Good equidistant codes constructed from certain combinatorial designs

DOI10.1016/j.disc.2007.08.022zbMath1145.94016OpenAlexW1985805580MaRDI QIDQ941348

B. E. Eshmatov

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.022

zbMATH Keywords

balanced arraynested BIB design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

J.N. Srivastava and experimental design ⋮ On traceability property of equidistant codes

Cites Work

• Some series of rectangular designs
• The equivalence of certain equidistant binary codes and symmetric BIBDS
• Two classes of \(q\)-ary codes based on group divisible association schemes
• Orthogonal arrays. Theory and applications
• Construction of nested balanced block designs, rectangular designs and \(q\)-ary codes
• A class of \(q\)-ary codes
• Balanced arrays of strength two from block designs
• Error-correcting codes over an alphabet of four elements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Good equidistant codes constructed from certain combinatorial designs