Binomial Moments of the Distance Distribution and the Probability of Undetected Error

Designs, Codes, and Cryptography

Volumn 16, Issue 2, 1999, Pages 103-116

  Barg, A ^a   Ashikhmin, A ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Binomial moments; Distance distribution; Rank generating function; Undetected error

Indexed keywords

EID: 0001421668     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008382528138     Document Type: Article

References (20)

1. K. A. S. Abdel-Ghaffar, A lower bound on the undetected error probability and strictly optimal codes, IEEE Trans. Inform. Theory, Vol. 43, No. 5 (1997) pp. 1489-1502.
2. A. Barg, The matroid of supports of a linear code, Applicable Algebra in Engineering, Communication and Computing, Vol. 8 (1997) pp. 165-172.
3. T. Brylawski and J. G. Oxley, The Tutte polynomial and its applications, in Matroid Applications (N. White, ed.), Encyclopedia of Mathematics and Its Applications, Vol. 40, Cambridge Univ. Press (1992).
4. N. J. Fine, Hypergeometric Series and Applications, AMS (1988).
5. C. Greene, Weight enumeration and the geometry of linear codes, Stud. Appl. Math., Vol. 55 (1976) pp. 119-128.
6. T. Helleseth, T. Kløve, and V. I. Levenshtein, On the information function of an error-correcting code, IEEE Trans. Inform. Theory, Vol. 43, No. 2 (1997) pp. 549-557.
7. l-1)/N), Discrete Math., Vol. 18 (1977) pp. 179-211.
8. G. L. Katsman and M. A. Tsfasman, Spectra of algebraic geometric codes, Problemy Peredachi Informatsii, Vol. 23, No. 4 (1988) pp. 19-34.
9. 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 (H. Stichtenoth and M. A. Tsfasman, eds.), Lect. Notes Math., Vol. 1518, Springer, Berlin (1992) pp. 82-98.
10. T. Kløve and V. I. Korzhik, Error Detecting Codes, Kluwer (1995).
11. T. Kløve, Bounds on the weight distribution of cosets, IEEE Trans. Inform. Theory, Vol. 42, No. 6 (1996) pp. 2257-2260.
12. V. I. Korzhik, Bounds on the probability of undetected error and optimum group codes in a channel with feedback, Radiotechnika, Vol. 20, No. 1 (1965) pp. 27-33. English translation in Telecommun. Radio Eng., Vol. 20, No. 1, pt. 2 (1965) pp. 87-92.
13. V. I. Korzhik, Bounds on the probability of undetected error and optimum group codes in a channel with feedback, Radiotechnika, Vol. 20, No. 1 (1965) pp. 27-33. English translation in Telecommun. Radio Eng., Vol. 20, No. 1, pt. 2 (1965) pp. 87-92.
14. V. K. Leontiev, Error-detecting encoding, Problemy Peredachi Informatsii, Vol. 8, No. 3 (1972) pp. 6-14.
15. V. I. Levenshtein, Bounds on the probability of undetected error, Problemy Peredachi Informatsii, Vol. 13, No. 1 (1977) pp. 3-18.
16. V. I. Levenshtein, Straight-line bound for the undetected error exponent, Problemy Peredachi Informatsii, Vol. 25, No. 1 (1989) pp. 33-37.
17. F. J. Mac Williams, A theorem on the distribution of weights in a systematic codes, Bell Syst. Techn. Journal, Vol. 42 (1963) pp. 79-94.
18. J. Simonis, The effective length of subcodes, Applicable Algebra in Engineering, Communication and Computing, Vol. 5 (1994) pp. 371-377.
19. D. J. A. Welsh, Complexity: Knots, Colourings and Counting, London Math. Society Lecture Note Series, Vol. 186, Cambridge Univ. Press, Cambridge (1993).
20. J. K. Wolf, A. M. Michelson, and A. H. Levesque, On the probability of undetected error for linear block codes, IEEE Trans. Commun, Vol. 30 (1982) pp. 317-324.