Characterizing completely regular codes from an algebraic viewpoint

MaRDI QIDQ3001410zbMATH OpenFDO

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

Publication date 31 May 2011

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

zbMATH Keywords

\(Q\)-polynomialcompletely regular codedistance-regular graphLeonard pair

Mathematics Subject Classification ID

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

Abstract: We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of the eigenspace that appear in the outer distribution module are equally spaced. In addition to the arithmetic codes of the companion paper, this highly structured class includes other beautiful examples and we propose the classification of $Q$-polynomial completely regular codes in the Hamming graphs. A key result is Theorem 3.10 which finds that the $Q$-polynomial condition is equivalent to the presence of a certain Leonard pair. This connection has impact in two directions. First, the Leonard pairs are classified and we gain quite a bit of information about the algebraic structure of any code in our class. But also this gives a new setting for the study of Leonard pairs, one closely related to the classical one where a Leonard pair arises from each thin/dual-thin irreducible module of a Terwilliger algebra of some $P$- and $Q$-polynomial association scheme, yet not previously studied. It is particularly interesting that the Leonard pair associated to some code $C$ may belong to one family in the Askey scheme while the distance-regular graph in which the code is found may belong to another.

Recommendations

• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• An algebraic characterization of completely regular codes in distance-regular graphs
• scientific article; zbMATH DE number 4110626
• A note on completely regular codes
• On completely regular codes
• On complete regularity of extended codes
• scientific article; zbMATH DE number 4072866
• Completely regular codes and completely transitive codes
• Codes from strongly regular \(( \alpha , \beta )\)-reguli
• On new completely regular q-ary codes

Cited in

(9)

• Classification of a class of distance-regular graphs via completely regular codes
• About non equivalent completely regular codes with identical intersection array
• On completely regular and completely transitive supplementary codes
• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• Harmonic distributions for equitable partitions of a hypercube
• scientific article; zbMATH DE number 6665189 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001410)