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

t-good and t-proper linear error correcting codes

Rossitza Dodunekova, S.M. Dodunekov

Published Jan 1, 2001• 1 citation
OpenAlex

Abstract

The probability of undetected error after using a linear code to correct \nerrors is investigated. Sufficient conditions \nfor a code to be t-good or t-proper for error correction are derived. Applications to various \nclasses of codes are discussed.

Related papers

Using codes for error correction and detection (Corresp.)

Torleiv Kløve

A linear codeCover GF(q)is good fort-error-correction and error detection ifP(C,t;\epsilon) \leq P(C,t;(q - 1)/q)for all\epsilon, 0 \leq \epsilon \leq (q - 1)/q, whereP(C, t; \epsilon)is the probability of an undetected error after a codeword inCis transmitted over aq-ary symmetric channel with error probability\epsilonand correction is performed for all error patterns withtor fewer errors. A sufficient condition for a code to be good is derived. This sufficient condition is easy to check, and examples to illustrate the method are given.

IEEE Transactions on Information Theory•Nov 1, 1984•6 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

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

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

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

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 linear codeCover GF(q)is good fort-error-correction and error detection ifP(C,t;\epsilon) \leq P(C,t;(q - 1)/q)for all\epsilon, 0 \leq \epsilon \leq (q - 1)/q, whereP(C, t; \epsilon)is the probability of an undetected error after a codeword inCis transmitted over aq-ary symmetric channel with error probability\epsilonand correction is performed for all error patterns withtor fewer errors. A sufficient condition for a code to be good is derived. This sufficient condition is easy to check, and examples to illustrate the method are given.
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.