IEEE Transactions on Information Theory

Concerning a bound on undetected error probability (Corresp.)

S. Leung-Yan-Cheong, Martin E. Hellman

Published Mar 1, 1976• 49 citations

Abstract

In the past, it has generally been assumed that the probability of undetected error for an(n,k)block code, used solely for error detection on a binary symmetric channel, is upperbounded by2^{-(n-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.

DOI: 10.1109/tit.1976.1055515

Related papers

Concerning a bound on undetected error probability

Kamal Gupta

In the past, it has generally been assumed that the probability of undetected error for an (n,k) block code, used solely for error detection on a binary symmetric channel, is upper bounded by 2-(n-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.

International Journal of Statistics and Applied MathematicsJan 1, 20171 citation

On some properties of the undetected error probability of linear codes (Corresp.)

S. Leung-Yan-Cheong, Earl R. Barnes, Donna L. Friedman

A recent paper [1] discussed the2^{-p}bound (wherep = n- k) for the probability of undetected errorP(\epsilon)for an(n,k)block code used for error detection on a binary symmetric channel. This investigation is continued and extended and dual codes are studied. The dual and extension of a perfect code obey the2^{-p}bound, but this is not necessarily true for arbitrary codes that obey the bound. Double-error-correcting BCH codes are shown to obey the bound. Finally the problem of constructing uniformly good codes is examined.

IEEE Transactions on Information TheoryJan 1, 197959 citations

Undetected error probability of hamming code for any number of symbols

Manish K. Gupta, Jaskaran Singh Bhullar, Bharat Naresh Bansal

In past papers, it has been shown that probability of undetected error Pu(ε) for binary (n = 2m- 1, k = n - m, 3) Hamming code (q = 2) used for error detection on binary symmetric channel satisfies the 2-pbound, where p is the parity check bits equal to n - k, hence binary Hamming codes are proper. In this correspondence this result is generalized and it has been shown that not only binary but Hamming Codes (for any value of q) satisfy this bound, so generalized Hamming codes are proper.

IEEE International Conference on Information Theory and Information SecurityDec 1, 20104 citations

Linear block codes for error detection (Corresp.)

Tadao Kasami, Torleiv Kløve, Shu Lin

The probability of undetected error of linear block codes for use on a binary symmetric channel is investigated. Upper hounds are derived. Several classes of linear block codes are proved to have good error-detecting capability.

IEEE Transactions on Information TheoryJan 1, 198337 citations

The probability of undetected error when a code is used for error correction and detection (Corresp.)

Torleiv Kløve

We study the probability of having an undetected error when a linear block code is used to correct up toterrors on a symmetric channel, and the remaining power of the code is used for error detection.

IEEE Transactions on Information TheoryMar 1, 198410 citations

An upper bound on the average probability of undetected error for the ensemble of all iterated codes

T. Nishijima

An upper bound on the average probability of undetected error for the ensemble of all iterated codes is given. It is assumed that the codes are binary linear block codes, and the channel is the binary symmetric channel.

IEEE Information Theory Workshop (ITW)Jan 20, 20031 citation