DocumentCode
1722944
Title
A new data compression algorithm for sources with memory based on error correcting codes
Author
Caire, Giuseppe ; Shamai, Shlomo ; Verdú, Sergio
fYear
2003
Firstpage
291
Lastpage
295
Abstract
A new fixed-length asymptotically optimal scheme for lossless compression of stationary ergodic tree sources with memory is proposed. Our scheme is based on the concatenation of the Burrows-Wheeler block sorting transform with the syndrome former of a linear error correcting code. Low-density parity-check (LDPC) codes together with belief propagation decoding lead to linear compression and decompression times, and to natural universal implementation of the algorithm.
Keywords
decoding; error correction codes; linear codes; parity check codes; source coding; transform coding; trees (mathematics); Burrows-Wheeler block sorting transform; LDPC codes; belief propagation decoding; block error rate; concatenation; data compression; linear code; linear error correcting codes; low-density parity-check codes; memory; stationary ergodic tree sources; syndrome former; Belief propagation; Data compression; Entropy; Error correction codes; Linear code; Maximum likelihood decoding; Parity check codes; Resilience; Statistics; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2003. Proceedings. 2003 IEEE
Print_ISBN
0-7803-7799-0
Type
conf
DOI
10.1109/ITW.2003.1216751
Filename
1216751
Link To Document