Error resilient locally adaptive data compression

Authors:
Hsien-Wen Tseng;Chin-Chen Chang
Affiliations:
Department of Information Management, Chaoyang University of Technology, Wufong Township, Taichung County, Taiwan, ROC;Department of Information Engineering and Computer Science, Feng Chia University, Seatwen, Taichung, Taiwan, ROC
Venue:
Journal of Systems and Software
Year:
2006

Citing 3
Cited 0

A locally adaptive data compression scheme

Communications of the ACM
A fast and simple algorithm for the construction of asymmetrical reversible variable length codes

Real-Time Imaging
Modified symmetrical reversible variable-length code and its theoretical bounds

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A data compression scheme that exploits locality of reference has been proposed by Bentley et al. in 1986 [Bentley, J.L., Sleator, D.D., Tarjan, R.E., Wei, V.K., 1986. A locally adaptive data compression scheme. Commun. ACM 29 (4), 320-330]. The scheme is based on a self-organizing move-to-front word list. However, a single error occurred on transmission channel could cause the lists of the encoder and decoder to differ, which could corrupt all reference data that follows. To reduce the impact of losing synchronization, a new list structure for the locally adaptive data compression scheme is proposed in this paper. From our analysis and experiments, the proposed scheme can enhance error resiliency of locally adaptive data compression while preserving high compression performance.