A note on binary completely regular codes with large minimum distance
Abstract
We classify all binary error correcting completely regular codes of length n with minimum distance δ>n/2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.