Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
494269 | Journal of Systems and Software | 2006 | 5 Pages |
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.