Properties 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} )$
From MaRDI portal
Publication:4123784
DOI10.1137/0131021zbMath0353.42010OpenAlexW2053524063MaRDI QIDQ4123784
Publication date: 1976
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0131021
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
\(q\)-rotations and Krawtchouk polynomials, On Foulkes characters, Subset representations and eigenvalues of the universal intertwining matrix, On classical orthogonal polynomials, Classical orthogonal polynomials of a discrete variable on nonuniform lattices, Character tables of association schemes based on attenuated spaces, Three addition theorems for some q-Krawtchouk polynomials, A partially ordered set and q-Krawtchouk polynomials, Symmetric bilinear forms over finite fields with applications to coding theory, Subschemes of the Johnson scheme, Askey-Wilson polynomials, kernel polynomials and association schemes, Kravchuk polynomials and group representations, Algebraic codes for network coding, Zeros of generalized Krawtchouk polynomials, The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters, Cameron-Liebler sets in bilinear forms graphs, Bilinear forms over a finite field, with applications to coding theory, Quadratic and symmetric bilinear forms over finite fields and their association schemes, Hyperplane sections of determinantal varieties over finite fields and linear codes
