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

DOI10.1137/0518015zbMATH Open0611.33013OpenAlexW2011598702MaRDI QIDQ3751874FDOQ3751874

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

Recommendations

• scientific article
• Parameters of association schemes that are both P- and Q-polynomial
• Askey-Wilson polynomials, kernel polynomials and association schemes
• A simple proof of main inequalities for fundamental parameters of codes in polynomial association schemes
• Association schemes and coding theory

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)

Cited In (31)

• Perfect codes in the discrete simplex
• Askey-Wilson polynomials, kernel polynomials and association schemes
• New constructions of Sidon spaces and large cyclic constant dimension codes
• Asymptotic expansion of the Krawtchouk polynomials and their zeros
• A family of linear codes from constant dimension subspace codes
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Design theory from the viewpoint of algebraic combinatorics
• Littlewood polynomials, spectral-null codes, and equipowerful partitions
• Constructions of cyclic constant dimension codes
• Perfect codes in Doob graphs
• Association schemes and quadratic transformations for orthogonal polynomials
• Zeros of generalized Krawtchouk polynomials
• New results involving a certain class of \(q\)-orthogonal polynomials
• An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
• Efficient Computation of the Fourier Transform on Finite Groups
• Constructions of Sidon spaces and cyclic subspace codes
• Subgroup Perfect Codes in Cayley Graphs
• Solutions of convex Bethe ansatz equations and the zeros of (basic) hypergeometric orthogonal polynomials
• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• Further constructions of cyclic subspace codes
• Tight 2-designs and perfect 1-codes in Doob graphs
• Linearity and complements in projective space
• Anticodes for the Grassmann and bilinear forms graphs
• 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
• A new approach for examining \(q\)-Steiner systems
• Global asymptotics of Krawtchouk polynomials -- a Riemann-Hilbert approach
• 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\)
• Title not available (Why is that?)
• Gradient system for the roots of the Askey-Wilson polynomial

This page was built for publication: On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory

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