An algebraic characterization of completely regular codes in distance-regular graphs (Q2784498)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algebraic characterization of completely regular codes in distance-regular graphs |
scientific article; zbMATH DE number 1732386
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algebraic characterization of completely regular codes in distance-regular graphs |
scientific article; zbMATH DE number 1732386 |
Statements
23 April 2002
0 references
distance-regular graph
0 references
local spectrum
0 references
orthogonal polynomials
0 references
completely regular code
0 references
edge-distance-regularity
0 references
An algebraic characterization of completely regular codes in distance-regular graphs (English)
0 references
