Linear codes from arcs and quadrics
This article constructs linear codes via geometrical arguments.\N\NA Korchmaros-Mazzocca \textit{KM-arc of type \(t\)}, also known under the name \textit{\((q+t,t)\)-arc of type \((0,2,t)\)}, is a set \(H\) of \(q+t\) points, intersecting every line of the projective plane PG\((2,q)\), \(q\) even, in \(0,2\) or \(t\) points. When \(t=2\), this set \(H\) is called a \textit{hyperoval}. Equivalently, a hyperoval \(H\) in PG\((2,q)\), \(q\) even, is a set of \(q+2\) points, intersecting every line in 0 or 2 points. An \textit{oval} in the projective plane PG\((2,q)\) is a set of \(q+1\) points, no three collinear. An \textit{ovoid} in the projective space PG\((3,q)\), \(q>2\), is a set of \(q^2+1\) points, no three collinear. The set of points of an elliptic quadric in PG\((3,q)\) is the classical example of an ovoid in PG\((3,q)\).\N\NIn coding theory, LCD codes are investigated. LCD codes are linear codes \(C\) with complementary dual, i.e., linear codes \(C\) which only share the zero vector with their dual code. Here, the authors consider the Euclidean and Hermitian scalar product to define the dual code of a linear code \(C\). A linear code \(C\) is called \textit{self-orthogonal} when it is contained in its dual code.\N\NThe authors construct linear codes using a newly developed representation of KM-arcs, hyperovals and elliptic quadrics via polar coordinates.\N\NIn particular, they construct LCD codes arising from ovals, Vandermonde sets and elliptic quadrics. They describe a large family of Euclidean self-orthogonal codes derived from ovals, and they derive some examples of quantum codes from this family. They also construct three-weight and four-weight LCD codes from KM-arcs.
- A coding theory construction of new systematic authentication codes
- A Generic Construction of Cartesian Authentication Codes
- A linear set view on KM-arcs
- Bent functions and line ovals
- Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\)
- Complementary dual codes for counter-measures to side-channel attacks
- Concise Encyclopedia of Coding Theory
- Constructions of optimal LCD codes over large finite fields
- Designs from linear codes
- Equivalence classes of Niho bent functions
- Euclidean and Hermitian LCD MDS codes
- Extended cyclic codes, maximal arcs and ovoids
- Finite Fourier series and ovals in PG(2, 2h)
- Fundamentals of Error-Correcting Codes
- Generalization of Steane's Enlargement Construction of Quantum Codes and Applications
- How to build robust shared control systems
- scientific article; zbMATH DE number 1342085 (Why is no real title available?)
- Hyperovals and bent functions
- LCD Cyclic Codes Over Finite Fields
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear codes with complementary duals
- Near MDS codes from oval polynomials
- New MDS Euclidean Self-Orthogonal Codes
- On (q + t)-arcs of type (0, 2, t) in a desarguesian plane of order q
- On \((q+t,t)\)-arcs of type \((0,2,t)\)
- On almost small and almost large super-Vandermonde sets in \(\mathrm{GF}(q)\)
- On circulant self-dual codes over small fields
- On KM-arcs in small Desarguesian planes
- Polar coordinates view on KM-arcs
- Self-dual codes and orthogonal matrices over large finite fields
- Short description of the Lunelli-Sce hyperoval and its automorphism group
- Some constructions of quantum MDS codes
- The geometry of Hermitian self-orthogonal codes
- The subfield codes of hyperoval and conic codes
- The Subfield Codes of Ovoid Codes
- Vandermonde sets and super-Vandermonde sets
- Vandermonde sets, hyperovals and Niho bent functions
This page was built for publication: Linear codes from arcs and quadrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7024142)
