IEEE Transactions on Information Theory

Bounds on the worst case probability of undetected error

Torleiv Kløve

Published Jan 1, 1995• 10 citations

Publisher

Abstract

Upper and lower bounds on the average worst-case probability of undetected error for linear [n,k,q] codes are given.>

DOI: 10.1109/18.370096

Related papers

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

The worst case probability of undetected error for linear codes on the local binomial channel

Torleiv Kløve

The worst case probability of undetected error for a linear [n,k:q] code used on a local binomial channel is studied. For the two most important cases it is determined in terms of the weight hierarchy of the code. The worst case probability of undetected error is determined explicitly for some classes of codes.

IEEE Transactions on Information TheoryJan 1, 199615 citations

The worst-case probability of undetected error for linear codes on the local binomial channel

Torleiv Kløve

The worst-case probability of undetected error for a linear [n,k;q] code used on a local binomial channel is studied. For the two most important cases it is determined in terms of the weight hierarchy of the code. The worst-case probability of undetected error for simplex codes is determined explicitly. A conjecture about Hamming codes is given.

IEEE International Symposium on Information Theory (ISIT)Nov 19, 20020 citations

Bounds on the Probability of Undetected Error for q-Ary Codes

Xuan Wang, Huizhou Liu, Patrick Solé

-ary codes. We give upper and lower bounds on this quantity, by the Linear Programming and the Polynomial methods, as a function of the length, size, and minimum distance. Sharper bounds are obtained in the important special case of binary Hamming codes. Finally, several examples are given to illustrate the results of this paper.

EntropySep 17, 20230 citations

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

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