scientific article; zbMATH DE number 4104861
From MaRDI portal
Publication:3829476
Recommendations
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- New families of completely regular codes and their corresponding distance regular coset graphs
- scientific article; zbMATH DE number 4110626
- Completely regular codes
- An algebraic characterization of completely regular codes in distance-regular graphs
Cited in
(17)- Classification of a class of distance-regular graphs via completely regular codes
- Yet another distance regular graph related to a Golay code
- About non equivalent completely regular codes with identical intersection array
- Distance-regular graphs admitting a perfect 1-code
- Completely regular codes in Johnson and Grassmann graphs with small covering radii
- On the coset graph construction of distance-regular graphs
- A new distance-regular graph of diameter 3 on 1024 vertices
- Families of nested completely regular codes and distance-regular graphs
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- New families of completely regular codes and their corresponding distance regular coset graphs
- An algebraic characterization of completely regular codes in distance-regular graphs
- scientific article; zbMATH DE number 4110626 (Why is no real title available?)
- scientific article; zbMATH DE number 17837 (Why is no real title available?)
- Extremal 1-codes in distance-regular graphs of diameter 3
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- Coverings and distance-regular graphs
- The subconstituent algebra of an association scheme. I
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829476)
