Families of completely transitive codes and distance transitive graphs

DOI10.1016/J.DISC.2014.02.008MaRDI QIDQ2440945zbMATH OpenOpenAlexFDO

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

Publication date 20 March 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

completely transitive codesdistance regular graphscompletely regular codesdistance transitive graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)

Abstract: In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $ho=3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$ and $2^m$, respectively, where $m$ is even. From these new completely transitive codes, in the usual way, i.e., as coset graphs, new presentations of infinite families of distance transitive coset graphs of diameter three and four, respectively, are constructed.

Recommendations

• On a family of binary completely transitive codes with growing covering radius
• New families of completely regular codes and their corresponding distance regular coset graphs
• scientific article; zbMATH DE number 177889
• On a class of binary linear completely transitive codes with arbitrary covering radius
• Families of nested completely regular codes and distance-regular graphs

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 7664095 (Why is no real title available?)
• Completely regular codes and completely transitive codes
• Completely transitive codes in Hamming graphs
• New families of completely regular codes and their corresponding distance regular coset graphs

Cited in

(16)

• On a family of binary completely transitive codes with growing covering radius
• Alphabet-almost-simple 2-neighbour-transitive codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• Conway's groupoid and its relatives
• Entry-faithful 2-neighbour transitive codes
• Transitive distance-regular graphs from linear groups \(L(3,q), q = 2,3,4,5\)
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
• Completely regular codes and completely transitive codes
• A new distance-regular graph of diameter 3 on 1024 vertices
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Minimal binary 2-neighbour-transitive codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• On the classification of binary completely transitive codes with almost-simple top-group
• Families of nested completely regular codes and distance-regular graphs
• scientific article; zbMATH DE number 177889 (Why is no real title available?)

This page was built for publication: Families of completely transitive codes and distance transitive graphs

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