A new burst error detecting code is described which has the form of the sum codes in that the check bits are determined from the algebraic sum of suitably weighted information bits. With the use of approximately k + log2 (n/k) redundancy bits,where n is the number of information bits, the resultant code will detect all bursts of errors of length k or less in any channel and will also be a perfect error detection code in a completely asymmetric channel
Many digital communication channels are affected by errors that tend to occur in bursts. A great dea...
Error correcting codes are required to ensure reliable communication of digitally encoded informatio...
This paper presents lower bounds on the number of parity-check digits required for a linear code tha...
A new burst error detecting code is described which has the form of the sum codes in that the check ...
The (n/2)-out-of-n code is proved to be the least redundant binary block code which permits the dete...
Some new codes are described which are separable and are perfect error detection codes in a complete...
This paper presents two types of integer codes capable of correcting burst asymmetric errors within ...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
This paper presents two classes of integer codes that are suitable for use in local area networks. T...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
In modern age, coding theory has found widespread theoretical and practical applications in the area...
In this paper, we present a class of integer codes capable of correcting burst asymmetric errors. Th...
The purpose of this thesis is to extend the present knowledge of burst error correcting codes. In th...
Checksums are routinely used to detect data transmission errors. However, design decisions about whi...
A new class of codes, called burst identification codes, is defined and studied. These codes can be ...
Many digital communication channels are affected by errors that tend to occur in bursts. A great dea...
Error correcting codes are required to ensure reliable communication of digitally encoded informatio...
This paper presents lower bounds on the number of parity-check digits required for a linear code tha...
A new burst error detecting code is described which has the form of the sum codes in that the check ...
The (n/2)-out-of-n code is proved to be the least redundant binary block code which permits the dete...
Some new codes are described which are separable and are perfect error detection codes in a complete...
This paper presents two types of integer codes capable of correcting burst asymmetric errors within ...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
This paper presents two classes of integer codes that are suitable for use in local area networks. T...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
In modern age, coding theory has found widespread theoretical and practical applications in the area...
In this paper, we present a class of integer codes capable of correcting burst asymmetric errors. Th...
The purpose of this thesis is to extend the present knowledge of burst error correcting codes. In th...
Checksums are routinely used to detect data transmission errors. However, design decisions about whi...
A new class of codes, called burst identification codes, is defined and studied. These codes can be ...
Many digital communication channels are affected by errors that tend to occur in bursts. A great dea...
Error correcting codes are required to ensure reliable communication of digitally encoded informatio...
This paper presents lower bounds on the number of parity-check digits required for a linear code tha...
DOI
Add to ORKG