Joint Source-Channel LZ'77 Coding

  • Authors:
  • Stefano Lonardi;Wojciech Szpankowski

  • Affiliations:
  • -;-

  • Venue:
  • DCC '03 Proceedings of the Conference on Data Compression
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Limited memory and bounded communication resources require powerful data compressiontechniques, but at the same time noisy tetherless channels and/or corruptedfile systems need error correction capabilities.Joint source-channel coding has emergedas a viable solution to this problem.We present here the first practical joint source-channel coding algorithm capable of correcting errors in the popular Lempel-Ziv'77scheme without practically losing any compression power.This is possible since theLZ'77 (as well as gzip) encoder does not completely remove all redundancy.The inherentadditional redundancy left by LZ'77 encoder is used succinctly by a channelcoder (e.g., Reed-Solomon coder) to protect against a limited number of errors.Inaddition to this, the scheme proposed here is perfectly backward-compatible, that is,a fiel compressed with out error-resilient LZ'77 can be still decompressed by a common LZ'77 decoder.In this preliminary report, we present our algorithm, collect some experimental data supporting our claims, and provide some theoretical justifications.