Constructions of nonbinary codes meeting the Johnson bound

DOI10.1134/S0032946024010022MaRDI QIDQ6585737zbMATH OpenFDO

Authors L. A. Bassalygo, Victor A. Zinoviev, Vladimir Lebedev

Publication date 12 August 2024

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946024010022

zbMATH Keywords

equidistant codeJohnson boundnonbinary constant-weight codesymbolwise uniform code

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Cites work

• A family of diameter perfect constant-weight codes from Steiner systems
• A New General Series of Balanced Incomplete Block Designs
• scientific article; zbMATH DE number 5963782 (Why is no real title available?)
• scientific article; zbMATH DE number 3463505 (Why is no real title available?)
• scientific article; zbMATH DE number 3438734 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 3410920 (Why is no real title available?)
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• Symmetric block designs and optimal equidistant codes
• Weakly resolvable block designs and nonbinary codes meeting the Johnson bound

This page was built for publication: Constructions of nonbinary codes meeting the Johnson bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585737)