Equidistant families of sets

DOI10.1016/0024-3795(95)00103-XzbMath0846.05007MaRDI QIDQ1899407

Mohan S. Shrikhande, Ionin, Yury J.

Publication date: 29 September 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

binary codesequidistant codescombinatorial designslinear polynomialsHadamard designcodewords

Mathematics Subject Classification ID

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

Related Items (4)

Some new results on Hadamard modulo prime matrices ⋮ Unnamed Item ⋮ On equidistant constant weight codes ⋮ Resolvable pairwise balanced designs.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On equidistant binary codes of length \(n=4k+1\) with distance \(d=2k\)
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• A theorem on equidistant codes
• The equivalence of certain equidistant binary codes and symmetric BIBDS
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• On t-designs
• Spherical codes and designs
• On generalizations of the deBruijn-Erdős theorem
• On a conjecture of jungnickel and tonchev for quasi‐symmetric designs
• Four fundamental parameters of a code and their combinatorial significance
• The Lattice Point Covering Theorem for Rectangles

This page was built for publication: Equidistant families of sets