An error-resilient blocksorting compression algorithm

Lee Butterman, Nasir Memon

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Summary form only given. The error susceptibility in the compressed bit stream is considered as a key limitation of adaptive lossless compression systems. The inherent design of these systems often requires that they discard all data subsequent to the error. This is especially problematic in the Burrows-Wheeler blocksorting transform (BWT), with 1MB suffix-sorted blocks. Error-correcting codes, such as Reed-Solomon codes, can be used but their design allows for a maximum pre-fixed error rate. If the channel errors exceed the maximum pre-fixed error rate, the whole block is lost. An error resilient version of the BWT was presented that has error-free output in low channel noise. It gracefully degrades output quality, as errors increase by scattering output errors, and avoids significant error propagation typical with adaptive lossless compression systems. These techniques give interesting new insights on the increasingly popular compression algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - DCC 2003
Subtitle of host publicationData Compression Conference
EditorsJames A. Storer, Martin Cohn
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0769518966
StatePublished - 2003
EventData Compression Conference, DCC 2003 - Snowbird, United States
Duration: Mar 25 2003Mar 27 2003

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


OtherData Compression Conference, DCC 2003
Country/TerritoryUnited States


  • Adaptive systems
  • Character generation
  • Compression algorithms
  • Computer science
  • Decoding
  • Degradation
  • Error analysis
  • Error correction codes
  • Histograms
  • Reed-Solomon codes

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'An error-resilient blocksorting compression algorithm'. Together they form a unique fingerprint.

Cite this