On completely regular binary codes and t-designs∗

DOI10.1016/S1571-0653(04)00352-XMaRDI QIDQ3438940zbMATH OpenOpenAlexFDO

Authors J. Borges, Josep Rifà, Victor A. Zinoviev

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

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

Cites work

• A note on completely regular codes
• Completely regular codes
• Completely regular codes and completely transitive codes
• Four fundamental parameters of a code and their combinatorial significance
• scientific article; zbMATH DE number 3970750 (Why is no real title available?)
• scientific article; zbMATH DE number 3695090 (Why is no real title available?)
• scientific article; zbMATH DE number 3480474 (Why is no real title available?)
• scientific article; zbMATH DE number 3497777 (Why is no real title available?)
• scientific article; zbMATH DE number 3499625 (Why is no real title available?)
• scientific article; zbMATH DE number 3521851 (Why is no real title available?)
• scientific article; zbMATH DE number 3601524 (Why is no real title available?)
• On the nonexistence of completely transitive codes
• On the Nonexistence of Perfect Codes over Finite Fields

Cited in

(1)

• Neighbour-transitive codes in Johnson graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438940)