Showing papers on "Burst error-correcting code published in 2000"
Patent•
10 Jan 2000TL;DR: In this paper, a data encoding apparatus is provided wherein, in one aspect, bit data are encoded by using at least one kind of errorcorrecting code out of two kinds of error-correcting modes.
Abstract: A data encoding apparatus is provided wherein, in one aspect, bit data are encoded by using at least one kind of error-correcting code out of two kinds of error-correcting modes—random error-correcting code mode and burst error correcting code mode. The encoded bit data are then arranged in a specific two-dimensional region in a matrix to form a two-dimensional image, which is then printed on a medium. The encoded bit data may be relocated in accord with a relocation map.
3 citations
Patent•
23 May 2000TL;DR: In this paper, a method of decoding interleaved Reed-Solomon codes to achieve an improved performance for burst errors is described, which takes advantage of both interleaving and erasure decoding to increase the error correcting capability of a system without necessarily depending on channel reliability information.
Abstract: A method of decoding interleaved Reed-Solomon codes to achieve an improved performance for burst errors is described. The method takes advantage of both interleaving and erasure decoding to increase the error correcting capability of a system without necessarily depending on channel reliability information. The observed correlation of burst errors in interleaved systems is advantageously used to achieve an improved error-correcting system, wherein a first code word is decoded, and the error locations in the first codeword are used to determine erasures for the remaining code words in the same interleaving block, and finally, decoding the remaining code words in parallel.
2 citations
Patent•
28 Jul 2000
TL;DR: In this paper, the error burst correction algorithm originally proposed by Fire but modified with the error trapping procedure based on recognition of first k bits of the syndrome generated by the secondary bursts is used jointly.
Abstract: Method and device for decoding with error correction of a cyclic code signal r(x) containing a main error burst shorter than or equal to a number n and a secondary error shorter than or equal to a number k where k
2 citations
25 Oct 2000
TL;DR: Additional evaluations of BERVFAC are given, i.e., time to execute encoding/decoding programs and error recovery probabilities under several conditions, by computer simulations, which evaluates influence of errors by counting the number of erroneous lines in decompressed data.
Abstract: Since compressed data are very sensitive to errors, several error control methods for compressed data have been proposed. The authors also proposed Burst Error Recovery VF Arithmetic Coding, or BREVFAC. This paper gives additional evaluations of BERVFAC which are not shown in the previous paper, i.e., time to execute encoding/decoding programs and error recovery probabilities under several conditions, by computer simulations. As another type of evaluation, this also evaluates influence of errors by counting the number of erroneous lines in decompressed data. Simulation results show that BERVFAC protects compressed data from burst errors which are beyond error recovery capability of the coding. For example, burst errors with more than 16 bits and less than 29 bits length corrupt about 0.3% of decompressed data in BERVFAC with source file "paper1", 1024 bits codeword, and 16 bits burst error recovery capability.