A self adaptive coding scheme for text and binary data
Ahmed H. Desoky, T. Klein · 2003
An effort is made to measure the amount of compression that can be accomplished using a heuristic coding algorithm. The scheme is based on the locality of the input symbols within a self-adaptive sequential list. An IBM-PC-based system has been developed for both encoding and decoding. The results using different adaptive sequential lists are presented. The test data include text files and binary files such as computer programs in executable forms and a 256-gray-levels image. Performance evaluation is discussed in terms of compression ratio, encoding time, and decoding time.>