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

DOI10.1016/j.disc.2013.11.009zbMath1339.94092arXiv1303.2547OpenAlexW2043430190MaRDI QIDQ394307

Josep Rifà, Victor A. Zinoviev

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 regular codescombinatorial codesdistance-transitive graphscompletely transitive codes

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)

Related Items (1)

On completely regular codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely regular codes and completely transitive codes
• On non-antipodal binary completely regular codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• Completely regular codes
• Completely transitive codes in Hamming graphs

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