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 Computers

Necessary and sufficient conditions on block codes correcting/detecting errors of various types

Jos H. Weber, Cornelis de Vroedt, Dick E. Boekee

Published Jan 1, 1992• 17 citations
Publisher

Abstract

Necessary and sufficient conditions are given for block codes to be capable of correcting up to t/sub 1/ symmetric errors, up to t/sub 2/ unidirectional errors, and up to t/sub 3/ asymmetric errors, as well as detecting from t/sub 1/+1 up to d/sub 1/ symmetric errors that are not of the unidirectional type, from t/sub 2/+1 up to d/sub 2/ unidirectional errors that are not of the asymmetric type, and from t/sub 3/+1 up to d/sub 3/ asymmetric errors. Many known conditions on block codes concerning error correction and/or detection appear as special cases of this general result. Further, some codes turn out to have stronger error correcting/detection capabilities than they were originally designed for.>

DOI
10.1109/12.165401

Related papers

LINEAR CODES HAVING A SUB-BLOCK STRUCTURE

Sat Narain Gupta, Anusha Malhotra

Linear codes having a sub-block structure are discussed. A substitute method of constructing codes capable of detecting and correcting combinations of error patterns in various sub-blocks is given. Codes where error-correction capabilities are determined in terms of various sub-blocks of the word length are introduced.

Journal of Cybernetics•Jul 1, 1976•1 citation

Bounds and constructions for binary block codes correcting asymmetric or unidirectional errors

Jos H. Weber

•Nov 23, 1989•13 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

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
Necessary and sufficient conditions are given for block codes to be capable of correcting up to t/sub 1/ symmetric errors, up to t/sub 2/ unidirectional errors, and up to t/sub 3/ asymmetric errors, as well as detecting from t/sub 1/+1 up to d/sub 1/ symmetric errors that are not of the unidirectional type, from t/sub 2/+1 up to d/sub 2/ unidirectional errors that are not of the asymmetric type, and from t/sub 3/+1 up to d/sub 3/ asymmetric errors. Many known conditions on block codes concerning error correction and/or detection appear as special cases of this general result. Further, some codes turn out to have stronger error correcting/detection capabilities than they were originally designed for.>
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.