ISIT 2003, IEEE International Symposium on Information Theory, June 29-July 4, 2003, Yokohama, Japan
Existing zero-error variable-length data compression algorithms suffer from sensitivity to transmission errors and error propagation across packets when used in packet-based data transmission through noisy channels. We propose a new approach to lossless data compression based on error correcting codes and the block-sorting transform. The proposed data compression scheme is compared with the universal algorithm for a four-state Markov chain in comparison with LZ (gzip) and a conventional BWT-based compressor (bzip). Although the comparison is quite encouraging, the main motivation and advantages of our scheme over the conventional separation-based approach accrue in the joint source/channel setting.
Type:
Conference
City:
Yokohama
Date:
2003-06-29
Department:
Communication systems
Eurecom Ref:
1332
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:
