A lower bound on the undetected error probability and strictly optimal codes

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1489-1502

  Abdel Ghaffar, Khaled A S ^a  

^a University of California   (United States)

Author keywords

Block codes; Distance enumerators; Error detection; Optimal codes

Indexed keywords

BINARY CODES; CODING ERRORS; DATA TRANSFER; ENCODING (SYMBOLS); ERROR DETECTION; PROBABILITY;

DISTANCE ENUMERATORS; OPTIMAL CODES; UNDETECTED ERROR PROBABILITY;

BLOCK CODES;

EID: 0031234895     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623147     Document Type: Article

References (35)

1. K. A. S. Abdel-Ghaffar and A. E. Abbadi, "Optimal disk allocation for partial match queries," ACM Trans. Database Syst., vol. 18, no. 1, pp. 132-156, Mar. 1993.
2. T. C. Ancheta, "An upper bound on the ratio of the probabilities of subgroups and cosets," IEEE Trans. Inform. Theory, vol. IT-27, pp. 646-647, Sept. 1981.
3. E. G. Andrews, "Telephone switching and the early Bell Laboratories computers," Bell Syst. Tech. J., vol. 42, no. 2, pp. 341-353, Mar. 1963.
4. A. E. Brouwer and T. Verhoeff, "An updated table of minimum-distance bounds for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, Mar. 1993.
5. T. Fujiwara, M. Ito, T. Kasami, M. Kataoka, and J. Okui, "Performance analysis of disk allocation method using error-correcting codes," IEEE Trans. Inform. Theory, vol. 37, pp. 379-384, Mar. 1991.
6. T. Fujiwara, T. Kasami, and S. Feng, "On the monotonic property of the probability of undetected error for a shortened code," IEEE Trans. Inform. Theory, vol. 37, pp. 1409-1411, Sept. 1991.
7. R. W. Hamming, "Error detecting and error correcting codes," Bell Syst. Tech. J., vol. 29, pp. 147-160, Apr. 1950.
8. _, Coding and Information Theory. Englewood Cliffs, NJ: Prentice-Hall, 1986.
9. M. E. Hellman, "Error detection made simple," in Int. Conf. on Communication, ICC'74 (Minneapolis, MN, June 17-19, 1974), pp. 9A1-A4.
10. T. Kasami, T. Kløve, and S. Lin, "Linear block codes for error detection," IEEE Trans. Inform. Theory, vol. IT-29, pp. 131-136, Jan. 1983.
11. T. Kasami and S. Lin, "On the probability of undetected error for the maximum distance separable codes," IEEE Trans. Commun., vol. COM-32, pp. 998-1006, Sept. 1984.
12. T. Kløve, "Generalizations of the Korzhik bound," IEEE Trans. Inform. Theory, vol. IT-30, pp. 771-773, Sept. 1984.
13. _, "Using codes for error correction and detection," IEEE Trans. Inform. Theory, vol. IT-30, pp. 868-870, Nov. 1984.
14. _, "Optimal codes for error detection," IEEE Trans. Inform. Theory, vol. 38, pp. 479-489, Mar. 1992.
15. _, "The weight distribution of cosets," IEEE Trans. Inform. Theory, vol. 40, pp. 911-913, May 1994.
16. _, "Bounds on the worst case probability of undetected error," IEEE Trans. Inform. Theory, vol. 41, pp. 298-300, Jan. 1995.
17. _, "Bounds on the weight distribution of cosets," IEEE Trans. Inform. Theory, vol. 42, pp. 2257-2260, Nov. 1996.
18. T. Kløve and V. I. Korzhik, Error Detecting Codes. Norwell, MA: Kluwer, 1995.
19. V. I. Korzhik, "Bounds on undetected error probability and optimum group codes in a channel with feedback," Radioteknika, vol. 20, no. 1, pp. 27-33, 1965.
20. (English translation: Telecommun. Radio Eng., vol. 20, no. 1, pp. 87-92, Jan. 1965.)
21. V. I. Korzhik and L. M. Fink, Noise-Stable Coding of Discrete Messages in Channels with a Random Structure, (in Russian). Moscow, Svyaz: 1975.
22. V. K. Leont'ev, "Error-detecting encoding," Probl. Pered. Inform., vol. 8, no. 2, pp. 6-14, 1972.
23. (English translation: Prob. Inform. Transm., vol. 8, no. 2, pp. 86-92, 1972.)
24. S. K. Leung-Yan-Cheong, E. R. Barnes, and D. U. Friedman, "On some properties of undetected error probability of linear codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 110-112, Jan. 1979.
25. S. K. Leung-Yan-Cheong and M. E. Hellman, "Concerning a bound on undetected error probability," IEEE Trans. Inform. Theory, vol. IT-22, pp. 235-237, Mar. 1976.
26. V. I. Levenshtein, "Bounds on the probability of undetected error," Probt. Pered. Inform., vol. 13, no. 1, pp. 3-18, 1977.
27. (English translation: Probl. Inform. Transm., vol. 13, no. 1, pp. 1-12, 1978.)
28. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
29. R. Padovani and J. K. Wolf, "Data transmission using error detection codes," in GLOBECOM'82, IEEE Global Telecommunications Conf. (Miami, FL, Nov. 29-Dec. 2, 1982), pp. C6.2.1-6.
30. P. Perry, "Necessary conditions for good error detection," IEEE Trans. Inform. Theory, vol. 37, pp. 375-378, Mar. 1991.
31. G. R. Redinbo, "Inequalities between the probability of a subspace and the probabilities of its cosets," IEEE Trans. Inform. Theory, vol. IT-19, pp. 533-536, July 1973.
32. P. Robillard, "Optimal codes," IEEE Trans. Inform. Theory, vol. IT-15, pp. 734-735, Nov. 1969.
33. R. C. Singleton, "Maximum distance q-n ary codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 116-118, Apr. 1964.
34. D. D. Sullivan, "A fundamental inequality between the probabilities of binary subgroups and cosets," IEEE Trans. Inform. Theory, vol. IT-13, pp. 91-94, Jan. 1967.
35. 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, Feb. 1982.