Characterizing completely regular codes from an algebraic viewpoint

zbMath1231.05300arXiv0911.1828MaRDI QIDQ3001410

Woo-Sun Lee, Jack H. Koolen, William J. Martin

Publication date: 31 May 2011

Full work available at URL: https://arxiv.org/abs/0911.1828

zbMATH Keywords

distance-regular graph\(Q\)-polynomialcompletely regular codeLeonard pair

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial codes (94B25)

Related Items (6)

New families of completely regular codes and their corresponding distance regular coset graphs ⋮ The Erdős-Ko-Rado theorem for twisted Grassmann graphs ⋮ About non equivalent completely regular codes with identical intersection array ⋮ Completely regular codes with different parameters giving the same distance-regular coset graphs ⋮ On completely regular and completely transitive supplementary codes ⋮ Harmonic Distributions for Equitable Partitions of a Hypercube

This page was built for publication: Characterizing completely regular codes from an algebraic viewpoint