On completely regular and completely transitive supplementary codes

DOI10.1016/j.disc.2019.111732zbMath1472.94072arXiv1902.07628OpenAlexW2990543612WikidataQ126775728 ScholiaQ126775728MaRDI QIDQ2286593

Josep Rifà, Joaquim Borges, Victor A. Zinoviev

Publication date: 22 January 2020

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

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

zbMATH Keywords

completely regular codescompletely transitive codesHamming codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

On new infinite families of completely regular and completely transitive codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• Induced perfect colorings
• Completely regular codes and completely transitive codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• Completely regular codes
• Completely regular codes by concatenating Hamming codes
• Completely transitive codes in Hamming graphs
• Perfect colorings of the 12-cube that attain the bound on correlation immunity
• Characterizing completely regular codes from an algebraic viewpoint
• The Geometry of Two-Weight Codes
• All nearly perfect codes are known
• Fundamentals of Error-Correcting Codes

This page was built for publication: On completely regular and completely transitive supplementary codes