Zeros of generalized Krawtchouk polynomials
Journal of Approximation TheoryPublished 1 January 1990Open access
Laura M. Chihara, Dennis Stanton
Citations48
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given. A new infinite family of integral zeros is given, and it is conjectured that these comprise most of the non-trivial zeros. The integral zeros for two families of q-Krawtchouk polynomials are classified.
Keywords
Mathematics
North-Holland mathematical libraryThe Theory of Error-Correcting Codes
11,012 Citations1977
This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Tutorials, schools, and workshops in the mathematical sciencesAn Introduction to Orthogonal Polynomials
631 Citations2020M. Foupouagnigni
IEEE Transactions on Information TheoryNew upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
447 Citations1977Robert J. McEliece, E. R. Rodemich +2 more
With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance, which is asymptotically less than Levenshtein's bound and so also Elias's.
Orthogonal Polynomials and Chevalley Groups
72 Citations1984Dennis Stanton
SIAM Journal on Mathematical AnalysisOn the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
63 Citations1987Laura M. Chihara
The parameters of the Askey–Wilson polynomial are classified so that its zeros are not contained in its spectrum, implying the nonexistence of perfect codes and tight designs in the classical association schemes.
SIAM Journal on Applied MathematicsProperties and Applications of the Recurrence $F( {i + 1,k + 1,n + 1} ) = q^{k + 1} F( {i,k + 1,n} ) - q^k F( {i,k,n} )$
53 Citations1976Philippe Delsarte
Journal of Combinatorial Theory Series AA partially ordered set and q-Krawtchouk polynomials
34 Citations1981Dennis Stanton
A derivation is given for the analytic expression of the polynomials, which uses a lowering operator on a partially ordered set, similar to a technique which has been applied to other partially ordered sets.