Binomial moments of the distance distribution: Bounds and applications

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 438-439

  Ashikhmin, Alexei ^a   Barg, Alexander ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Binomial moments; Distance distribution; Extremal codes; Linear programming; Rodemich theorem; Undetected error

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); ERROR ANALYSIS; ERROR DETECTION; LINEAR PROGRAMMING; PROBABILITY;

BINOMIAL MOMENTS; DISTANCE DISTRIBUTIONS; EXTREMAL CODES; RODEMICH THEOREM;

BINARY CODES;

EID: 0033098383     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.748994     Document Type: Article

References (34)

1. K.A. S. Abdel-Ghaffar, "A lower bound on the undetected error probability and strictly optimal codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1489-1502, Sept. 1997.
2. A. Barg, "The matroid of supports of a linear code," Applicable Algebra in Eng., Commun, and Comput., vol. 8, pp. 165-172, 1997.
3. A. Barg and A. Ashikhmin, "Binomial moments of the distance dis-tribution and the probability of undetected error," Designs, Codes and Cryptography, no. 2, 1999.
4. L.A. Bassalygo, "New upper bounds for codes correcting errors," Probl. Pered. Inform., vol. 1, no. 4, pp. 4114, 1965.
5. A.R. Calderbank, E. Rains, P. W. Shor, and N. J. A. Sloane, "Quantum error correction via codes over GF(4)," IEEE Trans. Inform. Theory, vol. 44, pp. 1369-1387, July 1998.
6. P. Delsarte, "Bounds for unrestricted codes, by linear programming," Philips Res. Repts., vol. 27, pp. 272-289, 1972.
7. "Bilinear forms over a finite field, with applications to coding theory," J. Comb. Theory Ser. A, vol. 25, pp. 226-241, 1978.
8. "Application and generalization of the Mac Williams transform in coding theory," in Proc. I5th Symp. Inform. Theory in the Benelux, 1994, pp. 944.
9. R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
10. C. Greene, "Weight enumeration and the geometry of linear codes," Stud. Appl. Math., vol. 55, pp. 119-128, 1976.
11. T. Helleseth, T. K10ve, and V. I. Levenshtein, "On the information function of an error-correcting code," IEEE Trans. Inform. Theory, vol. 43, pp. 549-557, Mar. 1997.
12. G. Kalai and N. Linial, "On thé distance distribution of codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1467-1472, Sept. 1995.
13. G.L. Katsman and M. A. Tsfasman, "Spectra of algebraic geometric codes," Probl. Pered. Inform., vol. 23, no. 4, pp. 19-34, 1988.
14. G.L. Katsman, M. A. Tsfasman, and S. G. Vlädu;, "Spectra of linear codes and error probability of decoding," in Coding Theory and Algebraic Geometry (Lecture Notes in Mathematics, vol. 1518), H. Stichtenoth and M. A. Tsfasman, Eds. Berlin: Springer, 1992, pp. 82-98.
15. T. Klove and V. I. Korzhik, Error Detecting Codes. Dordrecht, The Netherlands: Kluwer, 1995.
16. T. Klove, "Bounds on the weight distribution of cosets," IEEE Trans. Inform. Theory, vol. 42, pp. 2257-2260, Nov. 1996.
17. V.I. Korzhik, "Bounds on the probability of undetected error and optimum group codes in a channel with feedback," Radiotech., vol. 20, no. 1, pp. 27-33, 1965; English translation in Telecommun. Radio Eng., vol. 20, no. 1, pt. 2, pp. 87-92, 1965.
18. V.K. Leontiev, "Error-detecting encoding," Probl. Pered. Inform., vol. 8, no. 3, pp. 6-14, 1972.
19. V.I. Levenshtein, "Bounds on the probability of undetected error," Probl. Pered. Inform., vol. 13, no. 1, pp. 3-18, 1977.
20. "Bounds for packings of metric spaces and some applications," Probl. Kibern., vol. 40, pp. 43-110, 1983, in Russian.
21. "Straight-line bound for the undetected error exponent," Probl. Pered. Inform., vol. 25, no. 1, pp. 33-37, 1989.
22. "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, May 1995.
23. "Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes and some applications," 1997, preprint.
24. S. Litsyn, "New upper bounds on error exponents," this issue, pp. 385-398.
25. R.J. McEliece and J. Omura, "An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels," IEEE Trans. Inform. Theory, vol. IT-23, pp. 611-613, Sept. 1977.
26. R.J. McEliece, E. R. Rodemich, H. Rumsey, and L. R. Welch, "New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, Mar. 1977.
27. F.J. MacWilliams, "A theorem on the distribution of weights in a systematic codes," Bell Syst. Tech. J., vol. 42, pp. 79-94, 1963.
28. F.J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1981.
29. C.E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for codes on discrete memoryless channels-II, Inform. Contr., vol. 10, pp. 522-552, 1967.
30. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
31. J. Simonis, "The effective length of subcodes," Applicable Algebra in Eng., Commun, and Comput., vol. 5, pp. 371-377, 1994.
32. M.A. Tsfasman and S. G. Vlädu}, Algebraic-Geometric Codes. Dor-drecht, The Netherlands: Kluwer, 1990.
33. A. Viterbi and J. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
34. J.K. Wolf, A. M. Michelson, and A. H. Levesque, "On the probability of undetected error for linear block codes," IEEE Trans. Commun., vol. COM-30, pp. 317-324, 1982.