Abstract
Previous work has indicated that using an arithmetic encoder with reserved probability space can provide powerful error detection and error correction when used with a sequential decoding algorithm. However, performance improvements were limited at high error rates, principally because of the lack of an explicit decoding tree. In this work a Trellis Coded Modulation scheme is used to provide a convenient tree for a list decoding algorithm. Results are obtained for both a small alphabet application (SPIHT encoded image) and a large alphabet application (predictive lossless image compression). Simulations on AWGN channels with bit error rates in the range of 10-3 to 10-1.5 show significant packet recovery rates even for the poorest channels.
Original language | English (US) |
---|---|
Pages (from-to) | 302-311 |
Number of pages | 10 |
Journal | Data Compression Conference Proceedings |
DOIs | |
State | Published - 2001 |
ASJC Scopus subject areas
- Computer Networks and Communications