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

Using codes for error correction and detection (Corresp.)

Torleiv Kløve

Published Nov 1, 1984• 6 citations
Publisher

Abstract

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.

DOI
10.1109/tit.1984.1056972

Related papers

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

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

t-good and t-proper linear error correcting codes

Rossitza Dodunekova, S.M. Dodunekov

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.

•Jan 1, 2001•1 citation

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

Codes for Error Detection

Torleiv Kløve

There are two basic methods of error control for communication, both involving coding of the messages. With forward error correction, the codes are used to detect and correct errors. In a repeat request system, the codes are used to detect errors and, if there are errors, request a retransmission. Error detection is usually much simpler to implement than error correction and is widely used. However, it is given a very cursory treatment in almost all textbooks on coding theory. Only a few older books are devoted to error detecting codes. This book begins with a short introduction to the theory of block codes with emphasis on the parts important for error detection. The weight distribution is particularly important for this application and is treated in more detail than in most books on error correction. A detailed account of the known results on the probability of undetected error on the q-ary symmetric channel is also given.

Series on coding theory and cryptology•Apr 1, 2007•139 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
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.
There are two basic methods of error control for communication, both involving coding of the messages. With forward error correction, the codes are used to detect and correct errors. In a repeat request system, the codes are used to detect errors and, if there are errors, request a retransmission. Error detection is usually much simpler to implement than error correction and is widely used. However, it is given a very cursory treatment in almost all textbooks on coding theory. Only a few older books are devoted to error detecting codes. This book begins with a short introduction to the theory of block codes with emphasis on the parts important for error detection. The weight distribution is particularly important for this application and is treated in more detail than in most books on error correction. A detailed account of the known results on the probability of undetected error on the q-ary symmetric channel is also given.