\(ED_m\) code[1]
Alternative names: Equidistant code with maximal distance.
Description
Member of the family of \( (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.Member of code lists
Primary Hierarchy
References
- [1]
- N. V. Semakov, V. A. Zinoviev, “Equidistant q-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs”, Probl. Peredachi Inf., 4:2 (1968), 3–10; Problems Inform. Transmission, 4:2 (1968), 1–7
- [2]
- P. Boyvalenkov, D. Danev, "Linear programming bounds." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
Page edit log
- Victor V. Albert (2023-02-24) — most recent
Cite as:
“\(ED_m\) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/semakov_zinoviev