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 Average Value for the Probability of an Undetected Error

P.N. Perry, M.P.C. Fossorier

Published Apr 28, 2008• 2 citations
Publisher

Abstract

A new identity for the weight enumerator of a code is derived. The new identity is shown to be related to the average value of the probability of an undetected error when is a continuous random variable.
DOI
10.1109/tit.2008.920241

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

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

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•10 citations

The expected value for the probability of an undetected error using a linear code over an unknown binary symmetric channel

Patrick Perry

The expected value for the probability of an undetected error for a linear code over the binary symmetric channel, with p being a continuous random variable, is calculated. The random variable p is assumed to be from the interval [0, 1/2] or the interval [0, 1], with uniform distributions and beta distributions being used. Simple conditions on the weight enumerator of the code and its dual code are given to minimize the expected value for the probability of an undetected error. A necessary condition for good error detection is presented based on the expected value for the probability of an undetected error. Several new identities relating the weight enumerators of a code and its dual are obtained. Examples with [23,12] codes, with the family of [22,11] self-dual codes, and with the family of [32,16] self-dual codes are evaluated with respect to error detection.

•Jan 1, 2007•0 citations

The Expected Value for the Probability of an Undetected Error

Patrick Perry, M.P.C. Fossorier

The expected value for the probability of an undetected error for a linear code over the binary symmetric channel, with p being a continuous random variable, is calculated. The random variable p is assumed to be from the interval [0,½] or the interval [0,1], with uniform distributions and beta distributions being used. Simple conditions on the weight enumerator of the code and its dual code are given to minimize the expected value for the probability of an undetected error. A necessary condition for good error detection is derived.

IEEE Information Theory Workshop (ITW)•Oct 1, 2006•0 citations

ON THE PROBABILITY OF UNDETECTED ERROR FOR ITERATED CODES

Osamu Nagata, Ra S Awas

•Jan 1, 1983•0 citations
The expected value for the probability of an undetected error for a linear code over the binary symmetric channel, with p being a continuous random variable, is calculated. The random variable p is assumed to be from the interval [0, 1/2] or the interval [0, 1], with uniform distributions and beta distributions being used. Simple conditions on the weight enumerator of the code and its dual code are given to minimize the expected value for the probability of an undetected error. A necessary condition for good error detection is presented based on the expected value for the probability of an undetected error. Several new identities relating the weight enumerators of a code and its dual are obtained. Examples with [23,12] codes, with the family of [22,11] self-dual codes, and with the family of [32,16] self-dual codes are evaluated with respect to error detection.
The expected value for the probability of an undetected error for a linear code over the binary symmetric channel, with p being a continuous random variable, is calculated. The random variable p is assumed to be from the interval [0,½] or the interval [0,1], with uniform distributions and beta distributions being used. Simple conditions on the weight enumerator of the code and its dual code are given to minimize the expected value for the probability of an undetected error. A necessary condition for good error detection is derived.