On completely regular binary codes and t-designs∗

DOI10.1016/S1571-0653(04)00352-XzbMath1171.94369OpenAlexW2076209820MaRDI QIDQ3438940

Josep Rifà, Victor A. Zinoviev, Joaquim Borges

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00352-x

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other designs, configurations (05B30)

Related Items (1)

Neighbour-transitive codes in Johnson graphs

Cites Work

• Completely regular codes and completely transitive codes
• A note on completely regular codes
• Completely regular codes
• On the nonexistence of completely transitive codes
• Four fundamental parameters of a code and their combinatorial significance
• On the Nonexistence of Perfect Codes over Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On completely regular binary codes and t-designs∗