[Jump to code hierarchy]

\([6,3,4]_4\) Hexacode [1,2]

Alternative Names: Extended Golay code over \(\mathbb{F}_4\).

Description

The \([6,3,4]_4\) Hermitian self-dual MDS code that has connections to projective geometry, lattices [2], and conformal field theory [3]. Its weight enumerator is the Gleason polynomial \(g_7\) [4; Rem. 4.2.6].

A generator matrix for the hexacode is [5; Exam. 1.7.8] \begin{align} \begin{pmatrix} 1 & 0 & 0 & 1 & \omega & \omega\\ 0 & 1 & 0 & \omega & 1 & \omega\\ 0 & 0 & 1 & \omega & \omega & 1 \end{pmatrix}~,\tag*{$(1)$} \end{align}where \(\mathbb{F}_4 = \{0,1,\omega, \bar{\omega}\}\) is the quaternary Galois field.

The permutation automorphism group of the hexacode is \(A_5 \cong I\), and the automorphism group is \(3.A_6 \cong \Sigma(360\phi)\). This is expanded to \(3.S_6\) if one includes the Galois automorphism \(\omega \leftrightarrow \omega^2\) [5; Exam. 1.7.8][6; pg. 520][2; Ch. 3, pg. 82].

Decoding

Bounded-distance decoder requiring at most 34 real operations [7].

Notes

See [5; Sec. 10.3] for an exposition.See corresponding MinT database entry [8].

Cousins

  • Quadratic-residue (QR) code— The hexacode is the smallest example of an extended quadratic-residue code of Type \(4^H\) [9; Sec. 2.4.6][5; Exer. 363].
  • \(q\)-ary Hamming code— The hexacode is an extended quaternary Hamming code [5; Exer. 578].
  • \([[5,1,3]]\) Five-qubit perfect code— Applying the qubit Hermitian construction to the hexacode yields the \([[6,0,4]]\) quantum hexacode [10], and tracing out any one qubit of that code yields the \([[5,1,3]]\) five-qubit code [11; Cor. 9 and Cor. 10].
  • \([24, 12, 8]\) Extended Golay code— Extended Golay codewords can be obtained from hexacodewords [2]. The hexacode can be used to decode the extended Golay code [12].
  • \([23, 12, 7]\) Golay code— There is a connection between automorphisms of the even Golay code and the holomorph of the hexacode [3]. The hexacode is often referred to as the extended Golay code over \(\mathbb{F}_4\) [5].
  • Spherical design— The hexacode is a complex spherical 3-design when embedded into the complex sphere via the polyphase mapping [13].
  • Polyphase code— The hexacode is a complex spherical 3-design when embedded into the complex sphere via the polyphase mapping [13].
  • Coxeter-Todd \(K_{12}\) lattice— The hexacode can be used to obtain the Coxeter-Todd \(K_{12}\) lattice [14; Exam. 10.5.6][2; Ch. 7, pg. 198].
  • Niemeier lattice— The hexacode is the glue code for the Niemeier lattice \(D_4^6\) [2; Ch. 16, pg. 408].
  • \([5,3,3]_4\) Shortened hexacode— The shortened hexacode is obtained by puncturing the hexacode.

Primary Hierarchy

Parents
The hexacode is Hermitian self-dual [4; Rem. 4.2.6] and, as a result, is also trace-Hermitian self-dual additive [5; Sec. 9.10]. The hexacode and the shortened hexacode are extremal [5; Tab. 9.14][15; Tm. 12].
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 [16; pg. 289][17; Exam. 19.2.1].
The hexacode is an evaluation AG code over the quaternary Galois field \(\mathbb{F}_4 = \{0,1,\omega, \bar{\omega}\}\) with \(\cal X\) defined by \(x^2 y + \omega y^2 z + \bar{\omega} z^2 x = 0\) [18; Exam. 2.77].
A version of the hexacode is recovered for Denniston code parameters \(i=1\) and \(a=2\) [16].
Hexacodewords can be arranged in an order from smallest to largest, with each codeword differing at four places from the next [19][6; pg. 327].
\([6,3,4]_4\) Hexacode

References

  1. [1]

    K. A. Bush, “Orthogonal Arrays of Index Unity”, The Annals of Mathematical Statistics 23, 426 (1952) DOI

  2. [2]

    J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups (Springer New York, 1999) DOI

  3. [3]

    J. A. Harvey and G. W. Moore, “Moonshine, superconformal symmetry, and quantum error correction”, Journal of High Energy Physics 2020, (2020) arXiv:2003.13700 DOI

  4. [4]

    S. Bouyuklieva, “Self-dual codes”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 79-96 DOI

  5. [5]

    W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes (Cambridge University Press, 2003) DOI

  6. [6]

    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (Elsevier, 1977)

  7. [7]

    A. Vardy, “Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice”, IEEE Transactions on Information Theory 41, 1495 (1995) DOI

  8. [8]

    R. Schürer and W. Ch. Schmid, “Hexacode”, From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2015-09-03 URL

  9. [9]

    Self-Dual Codes and Invariant Theory (Springer-Verlag, 2006) DOI

  10. [10]

    A. J. Scott, “Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions”, Physical Review A 69, (2004) arXiv:quant-ph/0310137 DOI

  11. [11]

    E. M. Rains, “Quantum codes of minimum distance two”, (1997) arXiv:quant-ph/9704043

  12. [12]

    V. Pless, “Decoding the Golay codes”, IEEE Transactions on Information Theory 32, 561 (1986) DOI

  13. [13]

    V. V. Albert, private communication, 2024

  14. [14]

    T. Ericson and V. A. Zinoviev, eds., Codes on Euclidean Spheres (Elsevier, 2001)

  15. [15]

    G. Höhn, “Self-dual Codes over the Kleinian Four Group”, (2000) arXiv:math/0005266

  16. [16]

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

  17. [17]

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

  18. [18]

    T. Høholdt, J. H. van Lint, and R. Pellikaan, “Algebraic geometry codes”, in Handbook of Coding Theory, Vol. I, Part 1, eds. V. S. Pless and W. C. Huffman (Elsevier, 1998), pp. 871-961

  19. [19]

    R. A. Wilson, On lexicographic codes of minimal distance 4, Atti Sem. Mat. Fis. Univ. Modena 33 (1984)

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: hexacode

Cite as:
“\([6,3,4]_4\) Hexacode”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hexacode, arXiv:2606.11484
BibTeX:
@incollection{eczoo_hexacode,
title={\([6,3,4]_4\) Hexacode},
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/hexacode}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/hexacode

Cite as:

“\([6,3,4]_4\) Hexacode”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hexacode, arXiv:2606.11484

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