The performance of linear block codes over a finite field is investigated when they are used for pure error detection. Sufficient conditions for a code to be good or proper for error detection are derived
The performance of a linear error-detecting code in a symmetric memoryless channel is characterized ...
Classical linear error-detecting codes are not optimum for error detection in communication and comp...
A linear code, when used for error detection on a symmetric channel, is said to be proper if the cor...
The performance of linear block codes over a finite field is investigated when they are used for pur...
We have found earlier in [1] sufficient conditions for a linear blockcode to be good or proper for e...
Our lives depend on communication, but our methods are prone to errors. Coding theory illustrates ho...
AbstractA linear error-block code is a natural generalization of the classical error-correcting code...
This technical report discusses some of the aspects of error detection using finite fields
Abstract: Elements from extensions of qF are employed to construct a class of linear error-block co...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
The probability of undetected error after using a linear code to correct errors is investigated. Suf...
The undetected error probability of a linear code used to detect errors on a symmetric channel is a...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
We establish the properness of some classes of binary block codes with symmetric distance distributi...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
The performance of a linear error-detecting code in a symmetric memoryless channel is characterized ...
Classical linear error-detecting codes are not optimum for error detection in communication and comp...
A linear code, when used for error detection on a symmetric channel, is said to be proper if the cor...
The performance of linear block codes over a finite field is investigated when they are used for pur...
We have found earlier in [1] sufficient conditions for a linear blockcode to be good or proper for e...
Our lives depend on communication, but our methods are prone to errors. Coding theory illustrates ho...
AbstractA linear error-block code is a natural generalization of the classical error-correcting code...
This technical report discusses some of the aspects of error detection using finite fields
Abstract: Elements from extensions of qF are employed to construct a class of linear error-block co...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
The probability of undetected error after using a linear code to correct errors is investigated. Suf...
The undetected error probability of a linear code used to detect errors on a symmetric channel is a...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
We establish the properness of some classes of binary block codes with symmetric distance distributi...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
The performance of a linear error-detecting code in a symmetric memoryless channel is characterized ...
Classical linear error-detecting codes are not optimum for error detection in communication and comp...
A linear code, when used for error detection on a symmetric channel, is said to be proper if the cor...
DOI
Add to ORKG