[Jump to code hierarchy]

\(ED_m\) code[1]

Alternative Names: Equidistant code with maximal distance.

Description

Member of a family of nonlinear \( (c\frac{qt-1}{(t-1,q-1)},qt,ct\frac{q-1}{(t-1,q-1)}) \) \(q\)-ary codes, where \(c,t\geq 1\) and \((a,b)\) is the greatest common divisor of \(a\) and \(b\). Such codes are universally optimal and are related to resolvable block designs.

References

[1]
N. V. Semakov and V. A. Zinoviev, “Equidistant q-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs”, Problemy Peredachi Informatsii 4(2), 3–10 (1968); Problems of Information Transmission 4(2), 1–7 (1968)
[2]
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: semakov_zinoviev

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

Cite as:

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

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