Add to ORKGWe have found earlier in [1] sufficient conditions for a linear blockcode to be good or proper for error detection. These conditions areexpressed in terms of the weight distribution of the code. However, forcodes with small co-dimension or with small number of nonzero weights intheir dual codes the conditions would be technically easier to check if theywere presented in terms of the dual weight distribution. This alternativerepresentation is the purpose of the present paper
The undetected error probability, P(e), of linear (n,k) block codes used for transmission over a bi...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
Given a code C, invariant linear forms are used to study the designs afforded by codewords of a fixe...
We have found earlier in [1] sufficient conditions for a linear block code to be good or proper for ...
The performance of linear block codes over a finite field is investigated when they are used for pur...
A linear code, when used for error detection on a symmetric channel, is said to be proper if the cor...
The performance of a linear error-detecting code in a symmetric memoryless channel is characterized ...
Our lives depend on communication, but our methods are prone to errors. Coding theory illustrates ho...
We study a class of two-weight q-ary codes, considered by Baumert and McEliece, with regard to th...
The undetected error probability of a linear code used to detect errors on a symmetric channel is a...
Codes were invented to detect and correct transmission errors caused by noise on a communication cha...
We establish the properness of some classes of binary block codes with symmetric distance distributi...
This thesis concentrates on studying three problems in error-correcting codes: optimal encoding, tre...
AbstractA linear error-block code is a natural generalization of the classical error-correcting code...
The probability of undetected error after using a linear code to correct errors is investigated. Su...
The undetected error probability, P(e), of linear (n,k) block codes used for transmission over a bi...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
Given a code C, invariant linear forms are used to study the designs afforded by codewords of a fixe...
We have found earlier in [1] sufficient conditions for a linear block code to be good or proper for ...
The performance of linear block codes over a finite field is investigated when they are used for pur...
A linear code, when used for error detection on a symmetric channel, is said to be proper if the cor...
The performance of a linear error-detecting code in a symmetric memoryless channel is characterized ...
Our lives depend on communication, but our methods are prone to errors. Coding theory illustrates ho...
We study a class of two-weight q-ary codes, considered by Baumert and McEliece, with regard to th...
The undetected error probability of a linear code used to detect errors on a symmetric channel is a...
Codes were invented to detect and correct transmission errors caused by noise on a communication cha...
We establish the properness of some classes of binary block codes with symmetric distance distributi...
This thesis concentrates on studying three problems in error-correcting codes: optimal encoding, tre...
AbstractA linear error-block code is a natural generalization of the classical error-correcting code...
The probability of undetected error after using a linear code to correct errors is investigated. Su...
The undetected error probability, P(e), of linear (n,k) block codes used for transmission over a bi...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
Given a code C, invariant linear forms are used to study the designs afforded by codewords of a fixe...