Completely transitive codes and distance transitive graphs (Q4038772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 177889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completely transitive codes and distance transitive graphs |
scientific article; zbMATH DE number 177889 |
Statements
18 May 1993
0 references
\(e\)-latticed distance regular graphs
0 references
completely transitive codes
0 references
propelinear binary codes
0 references
distance transitive graphs
0 references
0.8658062219619751
0 references
0.8406168222427368
0 references
0.8349031209945679
0 references
0.8349031209945679
0 references
Completely transitive codes and distance transitive graphs (English)
0 references
[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?
0 references