IEEE International Conference on Information Theory and Information Security

Undetected error probability of hamming code for any number of symbols

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

Published Dec 1, 2010• 4 citations

Abstract

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.

DOI: 10.1109/icitis.2010.5689650

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

Concerning a bound on undetected error probability (Corresp.)

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

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.

IEEE Transactions on Information TheoryMar 1, 197649 citations

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

Good error-detection codes satisfying the expurgated bound

Takeshi Hashimoto

A q-ary (n, k) linear code is said to be proper if, as an error-detection code, the probability of undetectable error P/sub ud/ satisfies P/sub ud//spl les/q/sup -(n-k)/ for completely symmetric channels. We show that a proper code, as an error-correction code, satisfies the expurgated bound on the decoding error probability for a class of channels with the associated Bhattacharyya distance being completely symmetric. Known results on the undetectable error probability then immediately imply that the expurgated exponent is satisfied exactly by, for example, all the binary perfect codes, binary first-order Reed-Muller codes, binary (extended) Hamming code, binary 2-error correcting primitive BCH code, and all the maximum distance separable (MDS) codes, and asymptotically by some class of the binary t-error-correcting primitive BCH codes.>

IEEE Transactions on Information TheoryJan 1, 19955 citations

Bounds on the undetected error probabilities of linear codes for both error correction and detection

Mao‐Chao Lin

The author investigates the (n, k, d>or=2t+1) binary linear codes, which are used for correcting error patterns of weight at most t and detecting other error patterns over a binary symmetric channel. In particular, for t=1, it is shown that there exists one code whose probability of undetected errors is upper-bounded by (n+1) (2/sup n-k/-n)/sup -1/ when used on a binary symmetric channel with transition probability less than 2/n.>

IEEE Transactions on Information TheoryJan 1, 19900 citations

On the monotonic property of the probability of undetected error for a shortened code

Toru Fujiwara, Tadao Kasami, Shou-Ping Feng

The monotonic property of the probability of undetected error is considered when a shortened code of a linear code over GF(q) is used for error detection on a q-ary symmetric channel. Some conditions are presented under which the probability of undetected error is (or is not) monotonic with respect to the code length or the symbol error probability. It is shown that the probability of undetected error for a maximum distance separable code is monotonic with respect to the codelength. It is also shown that the probability of undetected error of a shortened code of any binary cyclic Hamming code generated by a trinomial is not monotonic with respect to the bit-error rate if the code length is short.>

IEEE Transactions on Information TheoryJan 1, 19916 citations