Showing papers on "Burst error-correcting code published in 1995"
Patent•
13 Mar 1995TL;DR: In this paper, a technique for simple burst trapping decoding of almost all bursts of length which approaches twice the maximum guaranteed burst length correcting capability with good burst error correcting and detecting capability was proposed.
Abstract: A technique deals with wide classes of cyclic codes for simple burst trapping decoding of almost all bursts of length which approaches twice the maximum guaranteed burst length correcting capability with good burst error correcting and detecting capability. The vector symbol codes achieve the highest burst correcting capability but use very long codes. "Perfect" codes can correct all bursts up to length t, and almost all bursts of length l, where t+1≦l≦n-k-t, with less than n2-(t-1) incorrect decoding probability for an n-bit code. The probability of an undetected error for any length burst is less than n2-(t-1). Shortened "perfect" codes can detect any burst of a double or triple error pattern.
25 citations
TL;DR: A new decoding algorithm for burst errors in Reed-Solomon codes is given and is shown to be more efficient than previously proposed methods.
Abstract: A new decoding algorithm for burst errors in Reed-Solomon codes is given. This algorithm is shown to be more efficient than previously proposed methods.
17 citations
3 citations
1 Jan 1995
TL;DR: This work proves that the asymptotically optimal transmission rate of binary codes correcting localized errors can be attained by codes with polynomial complexity of encoding, decoding, and code construction.
Abstract: The asymptotically optimal transmission rate of binary codes correcting localized errors is known when the number of errors grows linearly in the code length. Here we prove that this rate can be attained by codes with polynomial complexity of encoding, decoding, and code construction.
2 citations
17 Sep 1995
TL;DR: A canonical generator matrix of a QC-code which is invariant under T/sup L/ is introduced which shows the symmetric structure of the n/L-section minimal trellis diagram (MTD) and provides considerable information about thetrellis complexity of QC codes as well as the relation between these codes and convolutional codes.
Abstract: A linear block code C of length n is called quasi-cyclic (QC) if it is invariant under a cyclic shift of L positions, T/sup L/, where L
1 citations
17 Sep 1995
TL;DR: Based on matrix completion algorithms, new constructions for algebraic multilevel codes are given that can be used for channels with combinations of burst and random errors.
Abstract: Based on matrix completion algorithms, new constructions for algebraic multilevel codes are given. The constructions have low computational complexity and can be used for channels with combinations of burst and random errors.