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

Sufficient conditions for interval properness of linear error detecting codes

Rossitza Dodunekova, Li Weng

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

Properness of a linear error detecting code is a property which in a certain sense makes the code more appropriate for error detection over a symmetric memoryless channel than a non-proper one.This property is related to the undetected error probability of the code, which is a function of the channel symbol error probability, involving the code weight distribution.However, relatively few codes are known with their weight distribution.It is therefore useful to have criteria for properness which do not depend on the code weight distribution.Here we give sufficient conditions for interval properness of a q-ary linear error detecting code, which only involve the code length and the dual code distance.In case of binary codes our criterion reduces to a criterion known earlier.We also give examples, mostly on parametric classes of Griesmer codes, where intervals of properness have been found by help of the new criterion.It turns out that when the dimension of the Griesmer codes under consideration increases the intervals of properness converge to (0, (q -1)/q], i.e., the codes are asymptotically proper.

Related papers

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 Theory•Jan 1, 1995•5 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

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

Good error detection codes satisfy the expurgated bound

T. Hashimoto

A q-nary (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 by many codes which are regarded as good codes.

IEEE International Symposium on Information Theory (ISIT)•Nov 19, 2002•0 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•138 citations

Codes for error detection, good or not good

Irina Naydenova, Torleiv Kløve

Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value μ(d,k) such that if C is a code of length n >= μ(d,k), then neither C nor its dual are good for error detection. For d >> k or k << d good approximations for μ(d,k) are given. A generalization to non-linear codes is also given.

arXiv:cs/0508035•Aug 4, 2005•0 citations
Properness of a linear error detecting code is a property which in a certain sense makes the code more appropriate for error detection over a symmetric memoryless channel than a non-proper one.This property is related to the undetected error probability of the code, which is a function of the channel symbol error probability, involving the code weight distribution.However, relatively few codes are known with their weight distribution.It is therefore useful to have criteria for properness which do not depend on the code weight distribution.Here we give sufficient conditions for interval properness of a q-ary linear error detecting code, which only involve the code length and the dual code distance.In case of binary codes our criterion reduces to a criterion known earlier.We also give examples, mostly on parametric classes of Griesmer codes, where intervals of properness have been found by help of the new criterion.It turns out that when the dimension of the Griesmer codes under consideration increases the intervals of properness converge to (0, (q -1)/q], i.e., the codes are asymptotically proper.
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.>
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.
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.
A q-nary (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 by many codes which are regarded as good codes.
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.