Denniston code[1] 

Description

Projective code that is part of a family of \([2^{a+i}+2^i-2^a,3,2^{a+i}-2^a]_{GF(2^a)}\) codes for \(i < a\) constructed using Denniston arcs.

Notes

See corresponding MinT database entry [2].

Parents

Child

  • Hexacode — A version of the hexacode is recovered for Dennison code parameters \(i=1\) and \(a=2\) [5].

Cousin

  • Hyperoval code — Denniston codes for \(i=1\) are based on hyperovals in \(PG(2,2^a)\) [2].

References

[1]
R. H. F. Denniston, “Some maximal arcs in finite projective planes”, Journal of Combinatorial Theory 6, 317 (1969) DOI
[2]
Rudolf Schürer and Wolfgang Ch. Schmid. “Denniston Codes.” From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2015-09-03. http://mint.sbg.ac.at/desc_CDenniston.html
[3]
A. E. Brouwer, "Two-weight Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
[4]
P. Boyvalenkov, D. Danev, "Linear programming bounds." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
[5]
J. Bierbrauer, Introduction to Coding Theory (Chapman and Hall/CRC, 2016) DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: denniston

Cite as:
“Denniston code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/denniston
BibTeX:
@incollection{eczoo_denniston, title={Denniston code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/denniston} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/denniston

Cite as:

“Denniston code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/denniston

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