An error-resilient blocksorting compression algorithm

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.