Constructions of nonbinary codes meeting the Johnson bound

DOI10.1134/S0032946024010022MaRDI QIDQ6585737

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

Publication date: 12 August 2024

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

zbMATH Keywords

Johnson boundequidistant codesymbolwise uniform codenonbinary constant-weight code

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• Symmetric block designs and optimal equidistant codes
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• A New General Series of Balanced Incomplete Block Designs
• A family of diameter perfect constant-weight codes from Steiner systems
• 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)