On linear completely regular codes with covering radius =1. Construction and classification
Abstract
Completely regular codes with covering radius =1 must have minimum distance d≤ 3. For d=3, such codes are perfect and their parameters are well known. In this paper, the cases d=1 and d=2 are studied and completely characterized when the codes are linear. Moreover, it is proven that all these codes are completely transitive.
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.