Geometric Codes: New Links Between Curves and Error Correction

by

Author: Denis Avetisyan

Researchers have discovered a novel connection between geometric structures and error-correcting codes, expanding our understanding of both fields.

This work presents a construction of non-Desarguesian pseudo-arcs derived from normal rational curves and demonstrates their relationship to additive Maximum Distance Separable (MDS) codes.

While the classical upper bounds for pseudo-arc sizes have long been established, constructions of genuinely non-Desarguesian pseudo-arcs remain scarce. This paper, ‘On pseudo-arcs from normal rational curve and additive MDS codes’, introduces an infinite family of such pseudo-arcs, derived from the geometry of normal rational curves in projective space. Specifically, we demonstrate that these constructions yield pseudo-arcs of size O(q^h), asymptotically attaining known bounds and revealing a sharp construction even outside the Desarguesian setting. Furthermore, we establish a surprising connection between these geometric objects and recent families of additive maximum distance separable (MDS) codes, proving their non-equivalence to linear MDS codes-suggesting new avenues for code construction and a deeper understanding of the interplay between geometry and coding theory.

The Foundational Geometry of Arcs: Defining Projective Space

At the heart of classical projective geometry lies the concept of ‘arcs’, which are fundamentally sets of points possessing defined characteristics within projective spaces. These aren’t arcs in the traditional curved sense, but rather specific configurations of points satisfying particular algebraic or geometric constraints. A simple example might involve points lying on a projective curve, or those satisfying a homogeneous polynomial equation. The study of these arcs provides a foundational building block for understanding more complex structures within projective spaces – spaces where parallel lines meet at infinity and where geometric properties are preserved under projection. Indeed, the properties of these arcs dictate much of the behavior observed within these higher-dimensional geometries, making their rigorous examination crucial for developing a comprehensive understanding of projective space itself.

Classical arcs, fundamental components within projective geometries denoted as PG(k-1,q), exhibit inherent limitations when attempting to completely fill higher-dimensional projective spaces. These arcs, defined as sets of points that intersect any hyperplane in at most one point, struggle to achieve full span as dimensionality increases. The constraint arises from the geometric properties of these spaces; as the dimension k grows, the number of points required to guarantee complete coverage escalates rapidly, quickly exceeding the capacity of traditional arc constructions. This inability to fully span limits their applicability in areas like coding theory and the design of robust communication systems, motivating the exploration of more flexible and expansive geometric configurations that overcome these inherent restrictions.

The traditional understanding of geometric arcs, defined as sets of points satisfying specific criteria within projective spaces, proves insufficient when attempting to comprehensively map higher-dimensional configurations. Consequently, researchers are exploring alternatives that move beyond the limitations of strictly defined point sets. These investigations focus on more adaptable arrangements, allowing for a greater degree of freedom in how arcs are constructed and how they interact within the projective space. This shift necessitates embracing configurations that aren’t necessarily bound by the classical definitions of simple point collections, opening the door to structures that can more effectively span and characterize the complexities of PG(k-1,q) and related spaces. The pursuit of these flexible configurations is crucial for a more complete understanding of projective geometry beyond its foundational principles.

Classical arcs in projective geometry, while foundational, possess an inflexibility that restricts their ability to fully populate higher-dimensional spaces. This rigidity stems from the strict geometric constraints defining these structures – a fixed number of points satisfying specific intersection properties. Consequently, researchers have turned to generalized forms, notably pseudo-arcs, to overcome these limitations. Pseudo-arcs relax some of the traditional requirements, allowing for a greater degree of freedom in configuration and potentially enabling the construction of arcs that span larger projective spaces PG(k-1,q). This pursuit of generalization isn’t merely about expanding possibilities; it represents a fundamental shift in how arcs are conceived, moving from static, predetermined sets to more adaptable configurations capable of unlocking new geometric insights and constructions.

Pseudo-Arcs: A Generalized Framework for Complete Coverage

Pseudo-arcs generalize the concept of arcs in finite projective spaces by replacing the requirement of a single conic section with families of projective subspaces. Traditional arcs are defined as sets of points with no three collinear, typically lying on a single conic. Pseudo-arcs relax this constraint, allowing for coverage of the projective space PG(n,q) through multiple subspaces – specifically, families of m-dimensional projective subspaces. This generalization provides increased flexibility in construction and allows for the creation of configurations that are not possible with standard arc structures, while still maintaining a defined covering property of the space.

Pseudo-arcs offer an increased degree of freedom when spanning projective spaces compared to traditional arc structures. While standard arcs rely on a discrete set of points, pseudo-arcs utilize families of projective subspaces – specifically, configurations supported by quadrics and similar geometric objects. This allows for coverage of a projective space PG(n,q) with a structure that isn’t necessarily composed of individual points, but rather subspaces of varying dimensions. The flexibility arises from the ability to define pseudo-arcs based on the properties of these supporting configurations, enabling constructions that are not achievable with simpler, point-based arcs, and providing alternative methods for achieving complete spread coverage.

Desarguesian spreads are fundamental to the creation and analysis of pseudo-arc configurations due to their inherent properties of regularity and complete coverage. Specifically, a Desarguesian spread within a projective space of dimension 2n consists of 2^{n} subspaces, each of dimension n, such that every line intersects each subspace in exactly one point. These spreads provide a structured framework for defining the families of projective subspaces that constitute pseudo-arcs, ensuring a consistent and well-defined geometric basis. The properties of Desarguesian spreads, particularly their ability to partition the projective space, directly translate into the coverage characteristics exhibited by the resulting pseudo-arc configurations, allowing for a detailed examination of their spanning capabilities.

The construction of Desarguesian spreads, fundamental to pseudo-arc configurations, frequently utilizes semilinear collineations. These collineations are mappings of a projective space that combine a linear transformation with a field automorphism; specifically, points are mapped to points via x \mapsto Ax^{\sigma}, where A is an invertible linear transformation and σ is an automorphism of the underlying field. The application of semilinear collineations allows for the generation of spreads by repeatedly applying these mappings to a set of initial points or lines, ensuring the resultant configuration satisfies the spread properties of mutual disjointness and complete coverage. The choice of both the linear transformation A and the field automorphism σ dictates the specific structure of the generated spread and, consequently, the pseudo-arc configuration it supports.

Constructing 𝒫h,k,q: A Specific Pseudo-Arc Realization

The pseudo-arc 𝒫_{h,k,q} is generated by considering imaginary points stemming from a normal rational curve. Specifically, a normal rational curve of degree k in the projective space PG(h-1, q) is used as a base. Imaginary points are then derived from this curve by extending the field from GF(q) to GF(q^h). These points, which do not exist in the original projective space PG(h-1, q), become valid points when considered within the extended space PG(h-1, q^h). The set of these imaginary points, combined with selected points on the original curve, defines the structure of the pseudo-arc 𝒫_{h,k,q}.

The construction of the pseudo-arc 𝒫_{h,k,q} relies on osculating spaces, which are tangent spaces of increasing order to a given curve. Specifically, the points defining the pseudo-arc are generated by considering the k-dimensional osculating spaces to the normal rational curve. These spaces, defined at each point of the curve, provide a framework for establishing connections between points and ultimately defining the structure of the pseudo-arc. The dimension k dictates the order of contact used in defining these spaces, and consequently influences the geometric properties and spanning capability of the resulting pseudo-arc within the projective spaces PG(hk-1,q) and PG(hk-1,q^h).

The pseudo-arc 𝒫h,k,q is fundamentally linked to the characteristics of the projective spaces PG(hk-1,q) and PG(hk-1,q^h). Specifically, the construction relies on embedding the pseudo-arc within these spaces, meaning its geometric properties – such as the arrangement of its constituent points and the curves connecting them – are directly determined by the dimensionality (hk-1) and the order of the finite field (q and q^h) defining those spaces. Any alteration to these parameters – changing the values of h, k, or q – will necessarily result in a different pseudo-arc with distinct geometric characteristics within the corresponding projective spaces. This dependency ensures that the pseudo-arc’s structure is intrinsically tied to the foundational properties of the underlying projective geometry.

The pseudo-arc construction, utilizing parameters h and q, yields a total of |Λ_{h,q}| + q + 1 points. |Λ_{h,q}| represents the cardinality of the set Λh,q, which is defined as the set of q-dimensional subspaces of PG(hk-1, q^h) intersecting a specific hk-dimensional subspace. The addition of q accounts for points arising from the intersection of these subspaces, while the final ‘+1’ represents a designated point completing the pseudo-arc structure. This cardinality demonstrates that the constructed pseudo-arc effectively spans the projective space PG(hk-1, q), providing a sufficient number of points to define its geometric properties.

From Geometry to Coding: Additive MDS Codes and Pseudo-Arcs

Additive maximum distance separable (MDS) codes, crucial for reliable data transmission and storage, are fundamentally built upon the mathematical structures known as pseudo-arcs. Specifically, pseudo-arcs denoted as 𝒫_{h,k,q} serve as the core building blocks for these advanced codes. These arcs, defined within a finite projective geometry, provide a systematic way to arrange data points such that any loss or corruption of a limited number of points can be efficiently detected and corrected. The properties of 𝒫_{h,k,q}, particularly its size and arrangement of points, directly translate into the error-correcting capabilities and efficiency of the resulting additive MDS code, allowing for robust communication even in noisy environments. Consequently, understanding and constructing these pseudo-arcs is paramount to designing high-performance coding schemes.

Additive maximum distance separable (MDS) codes represent a significant advancement over traditional Hamming metric codes by enhancing error-correction capabilities, particularly in scenarios where data transmission or storage experiences noise or interference. While Hamming codes excel in detecting and correcting single-bit errors, additive MDS codes, built upon the principles of pseudo-arcs, can correct a greater number of errors without compromising data integrity. This improved performance stems from the codes’ ability to maintain a larger minimum distance between codewords, allowing for the reliable recovery of data even when multiple errors occur. The construction leverages the mathematical properties of finite fields and geometric designs, allowing for a flexible and robust coding scheme applicable to diverse communication and storage systems, and offering enhanced resilience against data corruption.

The significance of constructing pseudo-arcs, such as 𝒫_{h,k,q}, lies in their ability to approach a theoretical maximum in size. As the parameter q – representing the field size – increases, the number of points these pseudo-arcs can contain grows, asymptotically reaching the upper bound of q^h. This means that, for sufficiently large q, the constructed pseudo-arc effectively covers a proportionally larger space, maximizing its potential for error correction within additive maximum distance separable (MDS) codes. This asymptotic behavior is crucial, as it demonstrates the scalability and efficiency of this approach to coding, allowing for increasingly robust data transmission and storage as the field size expands.

The efficacy of constructing additive maximum distance separable (MDS) codes from pseudo-arcs hinges on a critical parameter: the field size q. A condition of q ≥ hk + 1 must be satisfied, where h and k define the specific pseudo-arc 𝒫h,k,q used in the coding scheme. This inequality isn’t merely a technicality; it directly guarantees that the resulting pseudo-arc possesses the necessary properties to function as a valid and reliable component in the construction of the additive MDS code. Without meeting this threshold, the code’s error-correcting capabilities become compromised, and the assurances of data integrity offered by the MDS structure are no longer valid, potentially leading to decoding failures and data loss.

The pursuit of constructing additive MDS codes, as detailed in this work, echoes a fundamental principle of mathematical rigor. The paper’s innovative approach to generating pseudo-arcs from normal rational curves isn’t merely about expanding the known families of these codes; it’s about establishing a provable connection between algebraic structures and geometric objects. As Ernest Rutherford observed, “If you can’t explain it to a child, you don’t understand it yourself.” This sentiment aptly captures the essence of the research; a complex interplay of finite geometry and coding theory distilled into a clear, demonstrable construction, verifiable through its underlying mathematical properties. The elegance lies not in the complexity of the calculations, but in the asymptotic scalability and provable correctness of the derived codes.

Where Do We Go From Here?

The presented construction, linking additive MDS codes to pseudo-arcs, offers more than just an expansion of known families. It suggests a deeper, potentially universal, correspondence between algebraic coding theory and finite geometry than currently appreciated. If one views the search for good codes as a geometric problem – a hunt for structures within projective space – then the tools of incidence geometry may prove unexpectedly potent. The current work, however, merely scratches the surface. A complete characterization of pseudo-arcs derived from these codes remains elusive; the constraints on parameters allowing for non-Desarguesian behavior are not fully understood.

Furthermore, the reliance on normal rational curves, while elegant, feels somewhat… limiting. Should one strive for constructions based on more general curves-perhaps those lacking the simplifying properties of rationality? If it feels like magic that these constructions work, it’s because the underlying invariant – the precise relationship between code structure and geometric properties – hasn’t been fully revealed.

Ultimately, the field requires a more axiomatic approach. Instead of seeking specific examples, a robust theory outlining the conditions under which any code can yield a non-Desarguesian structure would be invaluable. The goal isn’t simply to find more pseudo-arcs, but to understand why certain codes give rise to them, and what that reveals about the fundamental nature of space itself.

Original article: https://arxiv.org/pdf/2602.23130.pdf

Contact the author: https://www.linkedin.com/in/avetisyan/

See also:

2026-03-01 20:40