SIAM Journal on Mathematical Analysis · 1987 · 63 citations · 9 references
Natural SciencesComputer ScienceMathematicsAlgebraCombinatoricsInformation TheoryChannel CodingCoding TheoryError-correcting CodesAssociation SchemesPerfect Codes
In a symmetric association scheme that is (P and Q)-polynomial, the P and Q eigenmatrices are given by balanced ${}_4 \phi _3 $ Askey–Wilson polynomials. In this paper, the parameters of the Askey–Wilson polynomial are classified so that its zeros are not contained in its spectrum. These results, together with theorems of Biggs and Delsarte, imply the nonexistence of perfect codes and tight designs in the classical association schemes of type $A_N $, $B_N $, $C_N $, $D_N $ and the afl'lne matrix schemes.
9
An Introduction to Orthogonal Polynomials.
W. G., T. S. Chihara · Mathematics of Computation · 1981 · 3K citations
Generalized Hypergeometric Functions
Y. L. L., L. J. Slater · Mathematics of Computation · 1966 · 1.6K citations
Norman Biggs · Journal of Combinatorial Theory Series B · 1973 · 264 citations