Fault-Tolerant Text Data Compression Algorithms

Abstract

There has been an unparalleled explosion of textual information flow over the internet through electronic mail, web browsing, digital library and information retrieval systems, etc. Since there is a persistent increase in the amount of data that needs to be transmitted or archived, the importance of data compression is likely to increase in the near future. Virtually, all modern compression methods are adaptive models and generate variable-bit-length codes that must be decoded sequentially from beginning to end. If there is any error during transmission, the entire file cannot be retrieved safely. In this article we propose few fault-tolerant methods of text compression that facilitate decoding to begin with any part of compressed file not necessarily from the beginning. If any sequence of one or more bytes is changed during transmission of compressed file due to various reasons, the remaining data can be retrieved safely. These algorithms also support reversible decompression