Burst error recovery method for VF arithmetic codes

Author

Chen, Hongyuan ; Kitakami, Masato ; Fujiwara, Eiji

Author_Institution

Graduate Sch. of Inf. Sci. & Eng., Tokyo Inst. of Technol., Japan

fYear

1999

fDate

1999

Firstpage

124

Abstract

Compressed data are sensitive to any errors because they will spread on decompression. In order to overcome this in the case of arithmetic codes, some variable-to-fixed length (VF) arithmetic codes with error detecting capabilities were proposed by Cho and Kohno (1998), but no paper, up to now, has discussed the joint coding of data compression and error correction. This paper proposes an l-burst error recovery method for VF arithmetic codes. It divides the compressed data into fixed length words and inserts the internal states of the decompressor as well as the check parts of the interleaved parity code and the cyclic code into each word

Keywords

arithmetic codes; cyclic codes; data compression; error correction codes; error detection codes; interleaved codes; variable length codes; VF arithmetic codes; burst error recovery method; cyclic code; data compression; error correction; error detecting capabilities; interleaved parity code; variable-to-fixed length arithmetic codes; Arithmetic; Computer errors; Data compression; Data engineering; Encoding; Error correction codes; Information science; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE

Conference_Location

Kruger National Park

Print_ISBN

0-7803-5268-8

Type

conf

DOI

10.1109/ITCOM.1999.781455

Filename

781455