Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (5) , 1303-1321
- https://doi.org/10.1109/18.412678
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A new upper bound on the minimal distance of self-dual codesIEEE Transactions on Information Theory, 1990
- [60–6] An Extremum Problem for PolynomialsPublished by Springer Nature ,1982
- Discrete quadrature and bounds on $t$-designs.The Michigan Mathematical Journal, 1979
- Codes Which Detect DeceptionBell System Technical Journal, 1974
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- An upper bound for self-dual codesInformation and Control, 1973
- Some maximal arcs in finite projective planesJournal of Combinatorial Theory, 1969
- Maximum distanceq-nary codesIEEE Transactions on Information Theory, 1964
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950
- Factorial Experiments Derivable from Combinatorial Arrangements of ArraysJournal of the Royal Statistical Society Series B: Statistical Methodology, 1947