A note on binary completely regular codes with large minimum distance

DOI10.1016/J.DISC.2013.03.016MaRDI QIDQ389210zbMATH OpenOpenAlexFDO

Authors 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

Hamming codescompletely regular codesequidistant codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: We classify all binary error correcting completely regular codes of length $n$ with minimum distance $delta>n/2$.

Cites work

• scientific article; zbMATH DE number 3695090 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• A student's guide to coding and information theory.
• Completely regular codes
• Near-regularity conditions for designs
• On a class of binary linear completely transitive codes with arbitrary covering radius
• On non-antipodal binary completely regular codes

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

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