A note on binary completely regular codes with large minimum distance

DOI10.1016/J.DISC.2013.03.016zbMath1376.94056arXiv1210.6459OpenAlexW1996409906MaRDI QIDQ389210

Neil I. Gillespie

Publication date: 20 January 2014

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

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

zbMATH Keywords

completely regular codesequidistant codesHamming codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On non-antipodal binary completely regular codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• Completely regular codes
• Near-regularity conditions for designs
• A Student's Guide to Coding and Information Theory

This page was built for publication: A note on binary completely regular codes with large minimum distance