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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
