New locally adaptive data compression scheme using multilist structure

Henry Ker Chang Chang*, Shing Hong Chen

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

4 Scopus citations

Abstract

A new locally adaptive data compression scheme has been proposed in this paper. The proposed scheme may be viewed as an extension of the previous work by Bentley et al. in 1986. It is developed by the application of multilist structure and separate treatments for different types of data. Improving the overall performance of the method provided by Bentley et al. is its objective. The multilist structure aids in shortening the length of a transmitted code word and the treatment of numeric data aids in compression effect improvement. The feasibility of the proposed scheme has been validated by several experimental results and some theoretic analyses. The availability of various prefix coding methods developed by Jarnvall have finally been tested here. The incorporation of G1 prefix code in the proposed compression scheme works well in performance promotion.

Original languageEnglish
Pages (from-to)570-578
Number of pages9
JournalComputer Journal
Volume36
Issue number6
DOIs
StatePublished - 1993
Externally publishedYes

Fingerprint

Dive into the research topics of 'New locally adaptive data compression scheme using multilist structure'. Together they form a unique fingerprint.

Cite this