Advances in network information theory, Piyush Gupta, Gerhard Kramer, and Adriaan J. van Wijnggaardenl (Eds), Volume 66, DIMACS Series in Discrete Mathematics and Theoretical Computer Science
This paper presents a new approach to universal noiseless com- pression based on error correcting codes. The scheme is based on the concatenation of the Burrows-Wheeler block sorting transform (BWT) with the syndrome former of a Low-Density Parity-Check (LDPC) code. The proposed scheme has linear encoding and decoding times and uses a new closed-loop iterative doping algorithm that works in conjunction with belief-propagation decoding. Unlike the leading data compression methods our method is resilient against errors, and lends itself to joint source-channel encoding/decoding; fur- thermore it offers very competitive data compression performance.
Type:
Book
Date:
2004-09-01
Department:
Communication systems
Eurecom Ref:
1604
Copyright:
© DIMACS. Personal use of this material is permitted. The definitive version of this paper was published in Advances in network information theory, Piyush Gupta, Gerhard Kramer, and Adriaan J. van Wijnggaardenl (Eds), Volume 66, DIMACS Series in Discrete Mathematics and Theoretical Computer Science and is available at :
See also:
