[Jump to code hierarchy]

\(q\)-ary sharp configuration [1–3]

Alternative Names: Delsarte code in Hamming space, \(q\)-ary Delsarte code.

Description

A \(q\)-ary code that admits \(m\) different distances between distinct codewords and forms a design of strength \(2m-1\) or greater.

Cousins

  • \([23, 12, 7]\) Golay code— The dual \([23,11,8]\) even-weight subcode of the Golay code is a sharp configuration [4; Table 12.1].
  • \([2^m,m,2^{m-1}]\) Hadamard code— The augmented binary Hadamard code family is listed among the sharp configurations in [4; Table 12.1].
  • \([11,6,5]_3\) Ternary Golay code— The dual \([11,5,6]_3\) code of the ternary Golay code is the length-\(11\) ternary Golay-family sharp configuration in [4; Table 12.1].
  • Hyperoval code— Codes based on hyperovals in \(PG(2,q)\) are \(q\)-ary sharp configurations [4; Table 12.1].

Primary Hierarchy

Parents
All \(q\)-ary sharp configurations are universally optimal \(q\)-ary codes [3], but the converse is not true.
\(q\)-ary sharp configuration
Children
The extended Golay code is a sharp configuration [4; Table 12.1].
The SPC code is a binary sharp configuration [4; Table 12.1].
The extended ternary Golay code is a ternary sharp configuration [4; Table 12.1].
The \(q\)-ary repetition code is a \(q\)-ary sharp configuration [4; Table 12.1].
The ovoid code is a \(q\)-ary sharp configuration [4; Table 12.1].
The Denniston code is a \(q\)-ary sharp configuration [4; Table 12.1].
The \([56,6,36]_3\) Hill-cap code is a \(q\)-ary sharp configurations [4; Table 12.1].
The \([78,6,56]_4\) Hill-cap code is a \(q\)-ary sharp configuration [4; Table 12.1].
The \(ED_m\) code is a \(q\)-ary sharp configuration [4; Table 12.1].
The SZZ equidistant code is a \(q\)-ary sharp configuration [4; Table 12.1].

References

  1. [1]

    V. I. Levenshtein, “Designs as maximum codes in polynomial metric spaces”, Acta Applicandae Mathematicae 29, 1 (1992) DOI

  2. [2]

    V. I. Levenshtein, “Universal bounds for codes and designs”, in Handbook of Coding Theory, Vol. I, Part 1, eds. V. S. Pless and W. C. Huffman (Elsevier, 1998), pp. 499-648

  3. [3]

    H. Cohn and Y. Zhao, “Energy-Minimizing Error-Correcting Codes”, IEEE Transactions on Information Theory 60, 7442 (2014) arXiv:1212.1913 DOI

  4. [4]

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

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: delsarte_optimal_q-ary

Cite as:
“\(q\)-ary sharp configuration”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/delsarte_optimal_q-ary, arXiv:2606.11484
BibTeX:
@incollection{eczoo_delsarte_optimal_q-ary,
title={\(q\)-ary sharp configuration},
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/delsarte_optimal_q-ary}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/delsarte_optimal_q-ary

Cite as:

“\(q\)-ary sharp configuration”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/delsarte_optimal_q-ary, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/q-ary_digits/universally_optimal/delsarte_optimal_q-ary.yml.