Weakly resolvable block designs and nonbinary codes meeting the Johnson bound

DOI10.1134/s003294602201001xOpenAlexW4223613251MaRDI QIDQ6173444

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

Publication date: 21 July 2023

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

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

zbMATH Keywords

Johnson boundresolvable block designnonbinary codeweakly resolvable block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Related Items (1)

A family of diameter perfect constant-weight codes from Steiner systems

Cites Work

• Symmetric block designs and optimal equidistant codes
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weakly resolvable block designs and nonbinary codes meeting the Johnson bound