On pseudo-arcs from normal rational curve and additive MDS codes

Abstract Let normal upper P normal upper G left parenthesis k minus 1 comma q right parenthesis P G ( k − 1 , q ) $\mathrm{PG}(k-1,q)$ be the left parenthesis k minus 1 right parenthesis ( k − 1 ) $(k-1)$ -dimensional projective space over the finite field double struck upper F Subscript q F q ${\mathbb F}_q$ . An arc in normal upper P normal upper G left parenthesis k minus 1 comma q right parenthesis P G ( k − 1 , q ) $\mathrm{PG}(k-1,q)$ is a set of points with the property that any k of them span the entire space. The notion of a pseudo-arc generalises that of an arc by replacing points with higher-dimensional subspaces. Constructions of pseudo-arcs can be obtained from arcs defined over extension fields; such pseudo-arcs are necessarily Desarguesian , in the sense that all their elements belong to a Desarguesian spread. In contrast, genuinely non-Desarguesian pseudo-arcs are far less understood and have previously been known only in a few sporadic cases. In this paper, we introduce a new infinite family of non-Desarguesian pseudo-arcs consisting of left parenthesis h minus 1 right parenthesis ( h − 1 ) $(h-1)$ -dimensional projective subspaces of normal upper P normal upper G left parenthesis h k minus 1 comma q right parenthesis P G ( h k − 1 , q ) $\mathrm{PG}(hk-1,q)$ based on the imaginary spaces of a normal rational curve. We determine the size of the constructed pseudo-arcs explicitly

Authors

Institutions

Publication Details

Journal
Mathematical Proceedings of the Cambridge Philosophical Society
Published
2026-10-13
DOI
https://doi.org/10.1017/s0305004126102308
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On pseudo-arcs from normal rational curve and additive MDS codes

Francesco Pavese, Paolo Santonastaso
Mathematical Proceedings of the Cambridge Philosophical Society
Coding theory and cryptography
article

On pseudo-arcs from normal rational curve and additive MDS codes

Francesco Pavese, Paolo Santonastaso
article en

Abstract

Abstract Let normal upper P normal upper G left parenthesis k minus 1 comma q right parenthesis P G ( k − 1 , q ) $\mathrm{PG}(k-1,q)$ be the left parenthesis k minus 1 right parenthesis ( k − 1 ) $(k-1)$ -dimensional projective space over the finite field double struck upper F Subscript q F q ${\mathbb F}_q$ . An arc in normal upper P normal upper G left parenthesis k minus 1 comma q right parenthesis P G ( k − 1 , q ) $\mathrm{PG}(k-1,q)$ is a set of points with the property that any k of them span the entire space. The notion of a pseudo-arc generalises that of an arc by replacing points with higher-dimensional subspaces. Constructions of pseudo-arcs can be obtained from arcs defined over extension fields; such pseudo-arcs are necessarily Desarguesian , in the sense that all their elements belong to a Desarguesian spread. In contrast, genuinely non-Desarguesian pseudo-arcs are far less understood and have previously been known only in a few sporadic cases. In this paper, we introduce a new infinite family of non-Desarguesian pseudo-arcs consisting of left parenthesis h minus 1 right parenthesis ( h − 1 ) $(h-1)$ -dimensional projective subspaces of normal upper P normal upper G left parenthesis h k minus 1 comma q right parenthesis P G ( h k − 1 , q ) $\mathrm{PG}(hk-1,q)$ based on the imaginary spaces of a normal rational curve. We determine the size of the constructed pseudo-arcs explicitly

Mathematical Proceedings of the Cambridge Philosophical Society
Polytechnic University of Bari (IT)
Openalex Percentile: Top 88%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.