ITW 2003, IEEE Information theory workshop, Spring 2003, March 30-April 4th, 2003, Paris, France
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.
Type:
Conférence
City:
Paris
Date:
2003-03-31
Department:
Systèmes de Communication
Eurecom Ref:
1148
Copyright:
© 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
