A note on binary completely regular codes with large minimum distance
classification
🧮 math.CO
cs.ITmath.IT
keywords
binarycodescompletelydistanceminimumregularclassifycorrecting
read the original abstract
We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.