On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory

DOI10.1137/0518015zbMath0611.33013OpenAlexW2011598702MaRDI QIDQ3751874

Laura M. Chihara

Publication date: 1987

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0518015

zbMATH Keywords

association schemesperfect codesAskey-Wilson polynomialstight designs

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Related Items

On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\), Design theory from the viewpoint of algebraic combinatorics, Asymptotic expansion of the Krawtchouk polynomials and their zeros, Perfect codes in Doob graphs, Constructions of Sidon spaces and cyclic subspace codes, Anticodes for the Grassmann and bilinear forms graphs, Global asymptotics of Krawtchouk polynomials -- a Riemann-Hilbert approach, Completely regular codes in Johnson and Grassmann graphs with small covering radii, An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms, Linearity and complements in projective space, Characterizing subgroup perfect codes by 2-subgroups, Constructions of large cyclic constant dimension codes via Sidon spaces, Further constructions of large cyclic subspace codes via Sidon spaces, New constructions of Sidon spaces and large cyclic constant dimension codes, Subgroup Perfect Codes in Cayley Graphs, Solutions of convex Bethe ansatz equations and the zeros of (basic) hypergeometric orthogonal polynomials, New results involving a certain class of \(q\)-orthogonal polynomials, Constructions of cyclic constant dimension codes, A new approach for examining \(q\)-Steiner systems, Askey-Wilson polynomials, kernel polynomials and association schemes, Zeros of generalized Krawtchouk polynomials, Further constructions of cyclic subspace codes, Efficient Computation of the Fourier Transform on Finite Groups, A family of linear codes from constant dimension subspace codes, Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I, Tight 2-designs and perfect 1-codes in Doob graphs, Gradient system for the roots of the Askey-Wilson polynomial, Perfect codes in the discrete simplex