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 International Symposium on Information Theory (ISIT)

Good error detection codes satisfy the expurgated bound

T. Hashimoto

Published Nov 19, 2002• 0 citations
Publisher

Abstract

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.

DOI
10.1109/isit.1995.550330

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

Necessary conditions for good error detection

P.N. Perry

The problem of determining the error detection capabilities of linear codes where the channel is a binary symmetric channel is addressed. Necessary conditions are given on the number of codewords in an (n,k) linear code and its dual for the probability of an undetected error to be upper bounded by 2/sup -(n-k)/.>

IEEE Transactions on Information Theory•Mar 1, 1991•16 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

Codes for error detection, good or not good

I. Gancheva, 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 /spl mu/(d, k) such that if C is a code of length n /spl ges/ /spl mu/(d,k), then neither C nor its dual C/sup /spl perp// are good for error detection. For d /spl Gt/ k or k /spl Gt/ d good approximations for /spl mu/(d, k) are given. A generalization to nonlinear codes is also given.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•1 citation

Undetected error probability of hamming code for any number of symbols

Manish K. Gupta, Jaskaran Singh Bhullar, Bharat Naresh Bansal

In past papers, it has been shown that probability of undetected error Pu(ε) for binary (n = 2m- 1, k = n - m, 3) Hamming code (q = 2) used for error detection on binary symmetric channel satisfies the 2-pbound, where p is the parity check bits equal to n - k, hence binary Hamming codes are proper. In this correspondence this result is generalized and it has been shown that not only binary but Hamming Codes (for any value of q) satisfy this bound, so generalized Hamming codes are proper.

IEEE International Conference on Information Theory and Information Security•Dec 1, 2010•4 citations

Sufficient conditions for interval properness of linear error detecting codes

Rossitza Dodunekova, Li Weng

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.

•Jan 1, 2007•0 citations
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.
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.>
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.