Showing papers on "Burst error-correcting code published in 1968"
TL;DR: This paper discusses the use of two types of convolutional codes, diffuse threshold-decoded codes and Gallager codes, on channels with memory (burst channels), and proves that, for one important diffuse code, propagation is finite and small.
Abstract: This paper discusses the use of two types of convolutional codes, diffuse threshold-decoded codes and Gallager codes, on channels with memory (burst channels) The operation of these codes is explained and test results are given for a variety of equipments operated over phone line, HF radio, and troposcatter channels Error propagation in the threshold-decoded codes is discussed and, in the Appendix, we prove that, for one important diffuse code, propagation is finite and small
53 citations
TL;DR: The performance of three types of error control is evaluated for the case of independent random errors and for an actual channel exhibiting dense bursts.
Abstract: Much has been written on the theoretical description of error correcting codes but, due to a lack of actual channel error patterns, little has been said of practical performance. In this paper the performance of three types of error control is evaluated for the case of independent random errors and for an actual channel exhibiting dense bursts. The selected codes are burst codes with high probabilities of error detection and correction.
30 citations
TL;DR: In this paper two classes of error-correcting codes for use with data-transmission and data-storage systems have been constructed analytically and with the aid of a computer.
Abstract: Many data-transmission and data-storage systems are corrupted by disturbances of both the burst type and the random type. In this paper two classes of error-correcting codes for use with these systems have been constructed analytically and with the aid of a computer. Although not optimal, these codes do have the advantage of ease of implementation,
20 citations
TL;DR: Two new classes of type-B1 burst-error-correcting convolutional codes are introduced and can be avoided to correct type- B1 bursts by being derived in a straightforward manner and their implementations are also very simple.
Abstract: Two new classes of type-B1 burst-error-correcting convolutional codes are introduced. One of them requires a shorter length of guard space and a smaller number of shift register stages than optimum type-B2 codes used for type-B1 burst correction. Another class of codes improves the required number of shift register stages considerably when the correctable burst length is very large. In addition, these codes require a very short length of additional guard space to restore the decoder to correct operation after a decoding failure. Both classes of codes are derived in a straightforward manner and their implementations are also very simple. Thus, we can avoid type-B2 code procedures to correct type-B1 bursts. The codes derived here result in the more efficient and simply implemented type-B1 burst-correcting convolutional codes.
19 citations
1 Jan 1968
1 citations
TL;DR: A new class of error-correcting linear block codes using symbols from GF(2 m ) that are instantaneously decodable with a modest amount of hardware consisting almost entirely of mod 2 adders for correcting burst errors and efficiency compares favorably with the Varsharmov-Gilbert bound.
Abstract: In this paper, a new class of error-correcting linear block codes using symbols from GF(2 m ) is presented. These codes are not cyclic codes, but posses instead a unique algebraic structure. It is shown that they are instantaneously decodable with a modest amount of hardware consisting almost entirely of mod 2 adders for correcting burst errors. Furthermore, their efficiency compares favorably with the Varsharmov-Gilbert bound for both random errors over GF(2 m ) and burst errors over GF(2).