Abstract:
We prove that any symmetric block design (v,k,λ)(v,k,λ) generates optimal ternary and
quaternary constant-weight equidistant codes, whose parameters n,N,w,d,qn,N,w,d,q are uniquely determined by the parameters of the block design. For one rather special case, we construct
symbolwise uniform equidistant codes of the minimum length.
Citation:
L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Symmetric block designs and optimal equidistant codes”, Probl. Peredachi Inf., 56:3 (2020), 50–58; Problems Inform. Transmission, 56:3 (2020), 245–252
This publication is cited in the following 3 articles:
L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Constructions of nonbinary codes meeting the Johnson bound”, Problems Inform. Transmission, 60:1 (2024), 12–20
L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Weakly resolvable block designs and nonbinary codes meeting the Johnson bound”, Problems Inform. Transmission, 58:1 (2022), 1–12
V. Chauhan, A. Sharma, S. Sharma, M. Yadav, “Hamming weight distributions of multi-twisted codes over finite fields”, Designs Codes Cryptogr., 89:8 (2021), 1787–1837