Abstract
The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative ton andk only, and not the weight structure of the codes.
Similar content being viewed by others
References
S. Lin, D. J. Costello, Jr., Error control coding: fundamentals and applications, Englewood Cillfs, NJ: Prentice-Hall (1983).
T. Kassmi, T. Klove, S. Lin,IEEE Trans. on IT,IT-29 (1982) 1, 131–13.
J. K. Wolf, A. H. Michelson, A. H. Levesque,IEEE Trans. on COM,COM-30 (1982) 2, 317–324.
F. J. MacWilliams, N. J. A. Sloane, The theory of error-correcting codes, Amsterdam: North-Holland. (1977), pp. 225–232.
S. K. Leoung-Yan-Cheong, M. E. Hellman,IEEE Trans. on IT,IT-22 (1976) 2, 235–237.
S. K. Leoung-Yan-Cheong, E. R. Barnes, D. U. Friedman,IEEE Trans. on IT,IT-25 (1979) 1, 110–112,
T. Kassmi, S. Lin,IEEE Trans. on COM,COM-32 (1984) 9, 998–1006.
P. Perry,IEEE Trans. on IT,IT-37 (1991) 2, 375–378.
R. J. McEliece, The theory of information and coding, Addison- Weslay. Reading, Mass, (1979), pp.245–294.
Author information
Authors and Affiliations
About this article
Cite this article
Dazhaun, X. Error-detecting codes and undetected error probabilities. J. of Electron.(China) 11, 37–43 (1994). https://doi.org/10.1007/BF02778349
Issue Date:
DOI: https://doi.org/10.1007/BF02778349