Showing papers on "Burst error-correcting code published in 1975"
TL;DR: It is shown that a low-cost arithmtetic code with group length n detects all unidirectional multiple errors that affect fewer than n bits, as well as a larger class of such errors confined to a restricted set of bit positions.
Abstract: We show that a low-cost arithmtetic code with group length n detects all unidirectional multiple errors that affect fewer than n bits, as well as a larger class of such errors confined to a restricted set of bit positions.
45 citations
TL;DR: An algorithm is presented for the calculation of a cycle set for any cyclic code which has an irreducible parity-check polynomial.
Abstract: An algorithm is presented for the calculation of a cycle set for any cyclic code which has an irreducible parity-check polynomial.
6 citations
TL;DR: The double-error-correcting capabilities of the Iwadare and of the Berlekamp--Preparata-Massey burst-Correcting codes are analyzed.
Abstract: The double-error-correcting capabilities of the Iwadare and of the Berlekamp--Preparata-Massey burst-correcting codes are analyzed.