Title: Completely transitive codes and distance transitive graphs
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.
Publication Year: 1991
Publication Date: 1991-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 12
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot