On linear completely regular codes with covering radius $\rho=1$. Construction and classification
Information Theory
2009-06-03 v1 math.IT
Abstract
Completely regular codes with covering radius must have minimum distance . For , such codes are perfect and their parameters are well known. In this paper, the cases and are studied and completely characterized when the codes are linear. Moreover, it is proven that all these codes are completely transitive.
Cite
@article{arxiv.0906.0550,
title = {On linear completely regular codes with covering radius $\rho=1$. Construction and classification},
author = {J. Borges J. Rifa V. Zinoviev},
journal= {arXiv preprint arXiv:0906.0550},
year = {2009}
}
Comments
Submitted to IEEE, Trans. Inf. Theory