Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Theory

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

Torleiv Kløve

Published Jan 1, 1996• 15 citations
Publisher

Abstract

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.
DOI
10.1109/18.481787

Related papers

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, 2002•0 citations

Bounds on the worst case probability of undetected error

Torleiv Kløve

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

IEEE Transactions on Information Theory•Jan 1, 1995•10 citations

On the Probability of Undetected Error for Linear Block Codes

Jack K. Wolf, Arnold M. Michelson, Allen H. Levesque

The problem of computing the probability of undetected error is considered for linear block codes used for error detection. The recent literature is first reviewed and several results are extended. It is pointed out that an exact calculation can be based on either the weight distribution of a code or its dual. Using the dual code formulation, the probability of undetected error for the ensemble of all nonbinary linear block codes is derived as well as a theorem that shows why the probability of undetected error may not be a monotonic function of channel error rate for some poor codes. Several bounds on the undetected error probability are then presented. We conclude with detailed examples of binary and nonbinary codes for which exact results can be obtained. An efficient technique for measuring an unknown weight distribution is suggested and exact results are compared with experimental results.

IRE Transactions on Communications Systems•Feb 1, 1982•137 citations

On the probability of undetected error

Iiro S. Honkala, Tero K Laihonen

We show that for a code used for error detection or combined error correction and detection in the binary symmetric channel, the probability of an undetected error can have several local maxima. In particular, we construct a code with three local maxima in (0,1/2), a code with five local maxima in (0,1); and a linear code with two local maxima in (0,1/2) and a linear code with three local maxima in (0,1).

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•4 citations

The probability of undetected error can have several local maxima

Iiro S. Honkala, Tero K Laihonen

We show that for a code used for error detection in the binary-symmetric channel (BSC), the probability of an undetected error can have several local maxima. In particular, we construct a code with three local maxima in (0, 1/2), a code with five local maxima in (0, 1); and a linear code with two local maxima in (0, 1/2) and a linear code with three local maxima in (0, 1).

IEEE Transactions on Information Theory•Jan 1, 1999•5 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 Theory•Jan 1, 1990•0 citations
The problem of computing the probability of undetected error is considered for linear block codes used for error detection. The recent literature is first reviewed and several results are extended. It is pointed out that an exact calculation can be based on either the weight distribution of a code or its dual. Using the dual code formulation, the probability of undetected error for the ensemble of all nonbinary linear block codes is derived as well as a theorem that shows why the probability of undetected error may not be a monotonic function of channel error rate for some poor codes. Several bounds on the undetected error probability are then presented. We conclude with detailed examples of binary and nonbinary codes for which exact results can be obtained. An efficient technique for measuring an unknown weight distribution is suggested and exact results are compared with experimental results.