Completely transitive codes and distance transitive graphs
[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?
- Families of completely transitive codes and distance transitive graphs
- Completely regular codes and completely transitive codes
- scientific article; zbMATH DE number 4110626
- Completely transitive codes in Hamming graphs
- On a class of binary linear completely transitive codes with arbitrary covering radius
- On a class of binary linear completely transitive codes with arbitrary covering radius
- About non equivalent completely regular codes with identical intersection array
- Completely transitive codes in Hamming graphs
- Families of nested completely regular codes and distance-regular graphs
- Families of completely transitive codes and distance transitive graphs
- scientific article; zbMATH DE number 4110626 (Why is no real title available?)
- On a family of binary completely transitive codes with growing covering radius
- scientific article; zbMATH DE number 17837 (Why is no real title available?)
- Nonexistence of completely transitive codes with error-correcting capability e<3
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- Theoretical Aspects of Computing – ICTAC 2005
- On completely regular codes
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
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)