Concerning a Bound on Undetected Error Probability

  title={Concerning a Bound on Undetected Error Probability},
  author={Sik K. Leung-Yan-Cheong and Martin E. Hellman},
In the past, it has generally been assumed that the prohability of undetected error for an (n,k) block code, used solely for error detection on a binary symmetric channel, is upperbounded by 2-‘“-k’. In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquenghem (BCH) codes which do not obey the bound are given. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
22 Extracted Citations
4 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-4 of 4 references

Data Transmission

  • W Bennett, J Davey
  • Data Transmission
  • 1965
Highly Influential
1 Excerpt

kn Introduction to Error-Correcting Codes. Englewood Cliffs

  • S Lin
  • N.J
  • 1970
2 Excerpts

Error Correcting Codes

  • W W Peterson, E J Weldon
  • Error Correcting Codes

The author is with the Aalborg Universitets Center

  • The author is with the Aalborg Universitets…

Similar Papers

Loading similar papers…