On a family of binary completely transitive codes with growing covering radius

DOI10.1016/J.DISC.2013.11.009zbMATH Open1339.94092OpenAlexW2043430190MaRDI QIDQ394307FDOQ394307

Authors Victor A. Zinoviev, Josep Rifà 

Publication date 27 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

completely transitive codescompletely regular codescombinatorial codesdistance-transitive graphs

Mathematics Subject Classification ID

Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer r > 1, there exist two codes with d=3, covering radius r and length 2r(4r-1) and (2r+1)(4r+1), respectively. These new completely transitive codes induce, as coset graphs, a family of distance-transitive graphs of growing diameter.

Recommendations

• On a class of binary linear completely transitive codes with arbitrary covering radius
• Families of completely transitive codes and distance transitive graphs
• Completely regular codes and completely transitive codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• On the Kronecker Product Construction of Completely Transitive q-Ary Codes

Cites work

• 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 2232233 (Why is no real title available?)
• Completely regular codes
• Completely regular codes and completely transitive codes
• Completely transitive codes in Hamming graphs
• On a class of binary linear completely transitive codes with arbitrary covering radius
• On non-antipodal binary completely regular codes

Cited in

(4)

• Theoretical Aspects of Computing – ICTAC 2005
• On a class of binary linear completely transitive codes with arbitrary covering radius
• On completely regular codes
• Families of completely transitive codes and distance transitive graphs

This page was built for publication: On a family of binary completely transitive codes with growing covering radius

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