Completely transitive codes and distance transitive graphs

From MaRDI portal





[For the entire collection see Zbl 0758.00016.] This paper generalizes the concept of completely transitive codes to the propelinear binary codes. It is shown that the class of completely transitive propelinear binary codes is isomorphic to a class of \(e\)- latticed distance regular graphs, the distance transitive graphs. Open problems have also been listed at the end of the paper viz. are there completely regular linear codes not completely transitive? Or in general, are there completely regular propelinear codes not completely transitive? Equivalently, in the graphs domain, the same question arises, are there \(e\)-latticed distance regular graphs not distance transitive?











This page was built for publication: Completely transitive codes and distance transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038772)