Krawtchouk Polynomials and Universal Bounds for Codes and Designs in Hamming Spaces

IEEE Transactions on Information Theory

Volumn 41, Issue 5, 1995, Pages 1303-1321

  Levenshtein, Vladimir I ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

crosscorrelation; duality in bounding codes and orthogonal arrays; extreme roots; Linear programming; optimal polynomials; self dual codes

Indexed keywords

APPROXIMATION THEORY; CORRELATION THEORY; CRYPTOGRAPHY; LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; POLYNOMIALS; VECTORS;

BOUNDING CODES; CROSS CORRELATION; HAMMING SPACES; KRAWTCHOUK POLYNOMIALS; MACWILLIAMS TRANSFORM; ORTHOGONAL ARRAYS;

CODES (SYMBOLS);

EID: 0029378543     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.412678     Document Type: Article

References (43)

1. M. J. Aaltonen, “Linear programming bounds for tree codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 85–90, 1977.
2. —, “A new bound on nonbinary block codes,” Discr. Math., vol. 83, pp. 139–160, 1990.
3. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, “Simple construction of almost k-wise independent random variables,” Random Structures and Algorithms, vol. 3, no. 3, pp. 289–304, 1992.
4. E. Bannai and T. Ito, Algebraic Combinatorics. I. Association Schemes. London, UK: Benjamin/Cummings, 1984.
5. H. Batemann and A. Erdelyi, Higher Transcendental Functions, vol. 2. New York: McGraw-Hill, 1953.
6. R. C. Bose, “Mathematical theory of the symmetrical factorial design,” Sankhya, vol. 8, pp. 107–166, 1947.
7. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs. Berlin, Germany: Springer-Verlag, 1989.
8. R. Calderbank, “On uniformly packed [n, n — k — 4] codes over GF(q) and a class of caps in PG(k − 1, q),” J. London Math. Soc., vol. 26, pp. 365–384, 1982.
9. R. Calderbank and W. M. Kantor, “The geometry of two-weight codes,” Bull. London Math. Soc., vol. 18, pp. 97–122, 1986.
10. J. H. Conway and N. J. A. Sloane, “A new upper bound on the minimal distance of self-dual codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 1319–1333, 1990.
11. Ph. Delsarte, “Four fundamental parameters of a code and their combinatorial significance,” Inform. Contr., vol. 23, pp. 407–438, 1973.
12. —, “An algebraic approach to the association schemes of coding theory,” Philips Res. Rep., Suppl., vol. 10, 1973.
13. R. H. F. Denniston, “Some maximal arcs in finite projective planes,” J. Combin. Theory, vol. 6, pp. 317–319, 1969.
14. C. F. Dunkl, “Discrete quadrature and bounds on t — design,” Mich. Math. J., vol. 26, pp. 81–102, 1979.
15. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, “Codes which detect deception,” Bell Syst. Tech. J., vol. 53, pp. 405–424, 1974.
16. M. J. E. Golay, “Notes on digital coding,” Proc. IRE, vol. 37, p. 657, 1949.
17. R. W. Hamming, “Error detecting and error correcting codes,” Bell Syst. Tech. J., vol. 29, pp. 147–160, 1950.
18. R. Hill, “On the largest size cap in S5.3,” Rend. Acad. Naz. Lincei, vol. 54, no. 8, pp. 378–384, 1973.
19. —, “Caps and groups,” in Atti dei Covegni Lincei, Colloquio Intern. sulle Theorie Combinatorie (Roma, 1973), vol. 17 (Acad. Naz. Lincei), 1976, pp. 384–394.
20. G. A. Katabiansky and V. I. Levenshtein, “Bounds for packings on a sphere and in space,” Prob. Inform. Transmission, vol. 14, no. 1, pp. 1–17, 1978.
21. M. Krawtchouk, “Sur une généralisation des polynômes d'Hermite,” Compt. Rend., vol. 189, pp. 620–622, 1929.
22. C. W. M. Lam and V. Pless, “There is no (24, 12, 10) self-dual quaternary codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 1153–1156, 1990.
23. V. I. Levenshtein, “On choosing polynomials to obtain bounds in packing problems,” in Proc. 7th All-Union Conf. on Coding Theory and Information Transmission, pt. 2, Moscow-Vilnius, USSR, 1978, pp. 103–108 (in Russian).
24. —, “Bounds on the maximal cardinality of a code with bounded modulus of the inner product,” Soviet Math—Dokl., vol. 25, no. 2, pp. 526–531, 1982.
25. —, “Bounds for packings of metric spaces and some their applications,” in Problemy Cybernetiki, vol. 40. Moscow, USSR: Nauka, 1983, pp. 43–110 (in Russian).
26. —, “Designs as maximum codes in polynomial metric spaces,” Acta Applicandae Mathematicae, vol. 29, pp. 1–82, 1992.
27. —, “Bounds for self-complementary codes and their applications,” in Eurocode-92, CISM Courses and Lectures, vol. 339. Wien—New York: Springer-Verlag, 1993, pp. 159–171.
28. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
29. R. J. McEliece, E. R. Rodemich, H. Rumsey Jr., and L. R. Welch, “New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157–166, 1977.
30. C. L. Mallows and N. J. A. Sloane, “An upper bound for self-dual codes,” Inform. Contr., vol. 22, pp. 188–200, 1973.
31. A. Neumaier, “Combinatorial configuratons in terms of distances,” Eindhoven Univ. Technol., Eindhoven, The Netherlands, Memo. 81-09 (Wiskunde), 1981.
32. V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed. New York: Wiley, 1989.
33. B. Quist, “Some remarks concerning curves of the second degree in a finite plane,” Ann. Acad. Fenn. Sci. Ser. A, vol. 134, 1952.
34. C. R. Rao, “Factorial experiments derivable from combinatorial arrangements of arrays,” J. Roy. Stat. Soc., vol. 89, pp. 128–139, 1947.
35. I. Schoenberg and G. Szegö, “An extremum problem for polynomials,” Composito Math., vol. 14, pp. 260–268, 1960.
36. N. V. Semakov and V. A. Zinoviev, “Equidistant q-ary codes and resolved balanced incomplete block designs,” Prob. Inform. Transmission, vol. 4, no. 2, pp. 1–7, 1968.
37. N. V. Semakov, V. A. Zinoviev, and G. V. Zaitsev, “Class of maximal equidistant codes,” Probl. Inform. Transmission, vol. 5, no. 2, pp. 65–68, 1969.
38. V. M. Sidelnikov, “On mutual correlation of sequences,” Soviet Math.—Dokl., vol. 12, no. 1, pp. 197–201, 1971.
39. —, “On extremal polynomials used to estimate the size of codes,” Probl. Inform. Transmission, vol. 16, no. 3, pp. 174–186, 1980.
40. R. C. Singleton, “Maximum distance q—ary codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 116–118, 1964.
41. G. Szegö, Orthogonal Polynomials, vol. 23. Providence, RI: AMS Col. Publ., 1939.
42. H. N. Ward, “A bound for divisible codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 191–194, 1992.
43. L. R. Welch, “Lower bounds on the maximum correlation of signals,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 397–399, 1974.