On a class of binary linear completely transitive codes with arbitrary covering radius

DOI10.1016/j.disc.2009.03.004zbMath1176.94073OpenAlexW2027980713MaRDI QIDQ1044974

Josep Rifà, Victor A. Zinoviev

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.004

zbMATH Keywords

distance-regular graphintersection numberscovering radiuscompletely regular codecompletely transitive codedistance-transitive graphuniformly packed codeouter distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (8)

A note on binary completely regular codes with large minimum distance ⋮ On a family of binary completely transitive codes with growing covering radius ⋮ On completely regular codes ⋮ Characters and Brauer trees of the covering group of ²𝐸₆(2) ⋮ Conway’s groupoid and its relatives ⋮ Conway groupoids and completely transitive codes ⋮ On completely regular and completely transitive supplementary codes ⋮ On the classification of binary completely transitive codes with almost-simple top-group

Cites Work

• Completely regular codes and completely transitive codes
• On new completely regular \(q\)-ary codes
• On non-antipodal binary completely regular codes
• Completely regular codes
• On the nonexistence of completely transitive codes
• Nonexistence of completely transitive codes with error-correcting capability e<3
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a class of binary linear completely transitive codes with arbitrary covering radius