scientific article; zbMATH DE number 4155150

MaRDI QIDQ3483796zbMATH OpenFDO

Authors Eiichi Bannai

Publication date 1990

zbMATH Keywords

coding theorygroup representationDelsarte theorydesign theorytight t-designsP-polynomialAskey-Wilson orthogonal polynomialsgeneral commutative association schemesperfect e-codesQ- polynomial

Mathematics Subject Classification ID

Graph theory (05C99) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Applications of design theory to circuits and networks (94C30)

Recommendations

• On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
• scientific article; zbMATH DE number 2232233
• Association schemes and coding theory
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• scientific article; zbMATH DE number 3884178

Cited in

(14)

• On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
• Association schemes and hypergroups
• The non-symmetric Wilson polynomials are the Bannai-Ito polynomials
• On the limit of discrete \(q\)-Hermite I polynomials
• The subconstituent algebra of an association scheme. I
• Littlewood polynomials, spectral-null codes, and equipowerful partitions
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Finite Gel'fand pairs and their applications to probability and statistics
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Orbit-counting polynomials for graphs and codes
• Trees, wreath products and finite Gelfand pairs
• A graph with fractional revival
• On designs in compact metric spaces and a universal bound on their size
• Variants of Jacobi polynomials in coding theory

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 Q3483796)