[Jump to code hierarchy]

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

Primary Hierarchy

Parents
Hyperoval codes are \([q+2,3,q]_q\) MDS codes [11; Sec. 3.3.2]. For even \(q\geq 4\), hyperoval codes and their duals attain the maximum length \(q+2\) of nontrivial linear MDS codes over \(\mathbb{F}_q\) [12,13].
Hyperoval code
Children
Columns of hexacode’s generator matrix represent the six points of a hyperoval in the projective plane \(PG(2,4)\), an example of a two-weight code [9; pg. 289][2; Exam. 19.2.1].

References

  1. [1]

    R. C. Bose, “Mathematical theory of the symmetrical factorial design”, Sankhyā: The Indian Journal of Statistics, 107-166 (1947)

  2. [2]

    A. E. Brouwer, “Two-weight Codes”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 449-462 DOI

  3. [3]

    P. Boyvalenkov, D. Danev, “Linear programming bounds”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 251-266 DOI

  4. [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. [5]

    A. E. Brouwer and H. Van Maldeghem, Strongly Regular Graphs (Cambridge University Press, 2022) DOI

  6. [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. [7]

    A. Maschietti, “Difference Sets and Hyperovals”, Designs, Codes and Cryptography 14, 89 (1998) DOI

  8. [8]

    C. Ding, Codes from Difference Sets (WORLD SCIENTIFIC, 2014) DOI

  9. [9]

    J. Bierbrauer, Introduction to Coding Theory (Chapman and Hall/CRC, 2016) DOI

  10. [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. [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. [12]

    B. Chen and J. Huang, “On the MDS conjecture in even characteristic”, (2026) arXiv:2610.28208

  13. [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

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: hyperoval

Cite as:
“Hyperoval code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hyperoval, arXiv:2606.11484
BibTeX:
@incollection{eczoo_hyperoval,
title={Hyperoval code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/hyperoval}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/hyperoval

Cite as:

“Hyperoval code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hyperoval, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/q-ary_digits/projective/hyperoval.yml.