On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes

DOI10.1134/S0032946018030031zbMath1411.94108OpenAlexW2897296571WikidataQ129088450 ScholiaQ129088450MaRDI QIDQ2314155

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

Publication date: 19 July 2019

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

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

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25)

Related Items (3)

On \(q\)-ary codes with two distances \(d\) and \(d+1\) ⋮ Weakly resolvable block designs and nonbinary codes meeting the Johnson bound ⋮ Symmetric block designs and optimal equidistant codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• On the existence of super-simple designs with block size 4
• The preparata codes and a class of 4‐designs

This page was built for publication: On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes