Linear binary completely regular codes with distance 2

Abstract

We investigate completely regular codes with the small code distance. These codes are interesting because they play the role of natural subcodes of some good codes. The construction of the linear completely regular code with code distance 2 is given. The connected components of the graph of minimal distances of a linear completely regular code is described. The structure of a linear completely regular code with code distance 2 is studied.