Hyperoval code [1]
Description
Projective code constructed from a hyperoval in the projective plane \(PG(2,q)\), where \(q\) is even. Since a hyperoval is a set of \(q+2\) points with no three collinear, the corresponding projective code has parameters \([q+2,3,q]_q\) [2; Exam. 19.2.1]; the \([6,3,4]_4\) hexacode is the smallest example.Cousins
- \(q\)-ary sharp configuration— Codes based on hyperovals in \(PG(2,q)\) are \(q\)-ary sharp configurations [3; Table 12.1].
- Projective two-weight code— Codes based on hyperovals in \(PG(2,q)\) with even \(q\) are projective two-weight codes [4,5][2; Exam. 19.2.1][6; Table 7.1].
- Difference-set cyclic (DSC) code— Hyperoval difference sets yield DSC codes [7][8; Ch. 6].
- Extended GRS code— Columns of parity-check matrices of triply extended RS codes consist of points of a hyperoval [9; Prop. 17.5].
- Denniston code— Denniston codes for \(i=1\) realize the hyperoval case of maximal arcs in \(PG(2,2^a)\) [10][2; Sec. 19.7.3].
Primary Hierarchy
References
- [1]
R. C. Bose, “Mathematical theory of the symmetrical factorial design”, Sankhyā: The Indian Journal of Statistics, 107-166 (1947)
- [2]
A. E. Brouwer, “Two-weight Codes”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 449-462 DOI
- [3]
P. Boyvalenkov, D. Danev, “Linear programming bounds”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 251-266 DOI
- [4]
N. Tzanakis and J. Wolfskill, “The diophantine equation x2 = 4qa2 + 4q + 1, with an application to coding theory”, Journal of Number Theory 26, 96 (1987) DOI
- [5]
A. E. Brouwer and H. Van Maldeghem, Strongly Regular Graphs (Cambridge University Press, 2022) DOI
- [6]
R. A. Games, “The packing problem for projective geometries over GF(3) with dimension greater than five”, Journal of Combinatorial Theory, Series A 35, 126 (1983) DOI
- [7]
A. Maschietti, “Difference Sets and Hyperovals”, Designs, Codes and Cryptography 14, 89 (1998) DOI
- [8]
C. Ding, Codes from Difference Sets (WORLD SCIENTIFIC, 2014) DOI
- [9]
J. Bierbrauer, Introduction to Coding Theory (Chapman and Hall/CRC, 2016) DOI
- [10]
R. Schürer and W. Ch. Schmid, “Denniston Codes”, From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2015-09-03 URL
- [11]
P. R. J. Östergård, “Construction and Classification of Codes”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 61-78 DOI
- [12]
B. Chen and J. Huang, “On the MDS conjecture in even characteristic”, (2026) arXiv:2610.28208
- [13]
P. Kumar, “The MDS conjecture over finite fields of even order”, report and accompanying Lean formalization, Palomar record PALOMAR-2026-10-15-000014, version 1 (2026)
Page edit log
- Victor V. Albert (2026-11-08) — most recent
- Victor V. Albert (2026-06-08)
- Victor V. Albert (2023-03-05)
- Alexander Barg (2023-03-05)
- Victor V. Albert (2023-02-24)
Cite as:
“Hyperoval code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hyperoval, arXiv:2606.11484