Abstract
The class of completely transitive linear binary codes was introduced in [8] and it is proved that they are completely regular linear codes. The completely regular binary propelinear codes, a class of completely regular codes, and the e-latticed (e≥3) distance regular graphs, a class of distance regular graphs, are related in [4] and [5]. In this paper we generalize the completely transitive concept to the propelinear binary codes and we show that the class of completely transitive propelinear binary codes is isomorphic to a class of e-latticed distance regular graphs, the distance transitive graphs.
Cite
CITATION STYLE
Rifà, J., & Pujol, J. (1991). Completely transitive codes and distance transitive graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 539 LNCS, pp. 360–367). Springer Verlag. https://doi.org/10.1007/3-540-54522-0_124
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
