Families of nested completely regular codes and distance-regular graphs

DOI10.3934/AMC.2015.9.233MaRDI QIDQ2346713zbMATH OpenOpenAlexFDO

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

Publication date 3 June 2015

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.6358

zbMATH Keywords

completely transitive codesdistance-regular graphscompletely regular codesdistance-transitive graphs

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other types of codes (94B60)

Abstract: In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $ho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $iin1,ldots,u$ of binary (respectively, extended binary) Hamming codes of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.

Recommendations

• New families of completely regular codes and their corresponding distance regular coset graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• Families of completely transitive codes and distance transitive graphs
• Completely regular codes and completely transitive codes
• scientific article; zbMATH DE number 4104861

Cites work

• scientific article; zbMATH DE number 3871188 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 177889 (Why is no real title available?)
• scientific article; zbMATH DE number 3497777 (Why is no real title available?)
• scientific article; zbMATH DE number 3627058 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Antipodal covering graphs
• Antipodal distance-transitive covers of complete bipartite graphs
• Completely regular codes
• Completely regular codes and completely transitive codes
• Completely transitive codes in Hamming graphs
• Distance regular covers of the complete graph
• Families of completely transitive codes and distance transitive graphs
• New families of completely regular codes and their corresponding distance regular coset graphs
• On Lifting Perfect Codes
• The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes

Cited in

(9)

• On completely regular codes
• On non-antipodal binary completely regular codes
• A family of antipodal distance-regular graphs related to the classical Preparata codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• Coverings and distance-regular graphs
• Families of completely transitive codes and distance transitive graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• Conway's groupoid and its relatives
• Yet another distance regular graph related to a Golay code

This page was built for publication: Families of nested completely regular codes and distance-regular graphs

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