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

Journal of Discrete Mathematical Sciences and Cryptography

On the probability of undetected error for binary codes used for combined correction and detection

Iiro S. Honkala, Tero K Laihonen

Published Aug 1, 2001• 2 citations
Publisher

Abstract

We show that for a code used for combined error correction and detection in the binary symmetric channel, the probability of an undetected error can have several local maxima.
DOI
10.1080/09720529.2001.10697930

Related papers

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

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 Theory•Mar 1, 1984•9 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

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, 2003•1 citation

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 Theory•Jan 1, 1983•37 citations