Showing papers on "Burst error-correcting code published in 1977"
TL;DR: For certain binary cyclic codes, the exact weight distributions can be determined by the methods of this paper.
Abstract: Recent results of the author on linear recurring sequences are used to obtain estimates for the weights of code words in general cyclic codes. If the parity-check polynomial of the code has no multiple roots, a refined estimate can be established that contains previous results on irreducible cyclic codes. For certain binary cyclic codes, the exact weight distributions can be determined by the methods of this paper.
31 citations
TL;DR: Lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts are presented.
6 citations
TL;DR: Linear codes are developed and their low-density-burst-error correction capabilities are described in terms of various digits of a code word.
Abstract: Linear codes are developed and their low-density-burst-error correction capabilities are described in terms of various digits of a code word.
2 citations
2 citations
TL;DR: A generalization of the standard burst error trapping decoder for (n,k) cyclic block codes is presented that will correct both a d -bit deletion and up to a (B - d) -bit additive noise error imbedded within a single error burst of length B -bits or less.
Abstract: A generalization of the standard burst error trapping decoder for (n,k) cyclic block codes is presented that will correct both a d -bit deletion (d \leq D) and up to a (B - d) -bit additive noise error imbedded within a single error burst of length B -bits or less. B and D are design parameters of the decoder and are subject to the constraint D \leq B . An efficient implementation of this decoder which contains (D + 1) detectors, each set to a specified deletion count is given.
2 citations