Two classes of \(q\)-ary codes based on group divisible association schemes

DOI10.1016/S0012-365X(98)00186-1zbMath0936.05015MaRDI QIDQ1296993

Sanpei Kageyama, Ying Miao

Publication date: 2 November 1999

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

zbMATH Keywords

group divisible designs\(q\)-ary codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30)

Related Items (2)

Good equidistant codes constructed from certain combinatorial designs ⋮ Construction of nested balanced block designs, rectangular designs and \(q\)-ary codes

Cites Work

• A class of \(q\)-ary codes
• On Representatives of Subsets
• Some Generalizations of Distinct Representatives with Applications to Statistical Designs
• On the Number of Systems of Distinct Representatives of Sets
• A Combinatorial Theorem with an Application to Latin Rectangles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two classes of \(q\)-ary codes based on group divisible association schemes