Optimal Lossless Compression of a Class of Dynamic Sources (1997)
| Venue: | Proc Data Compression Conference, edited by J.A. Storer and J.H. Reif. IEEE Computer Society Press, Los Alamitos, CA |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Reif97optimallossless,
author = {John H. Reif and James A. Storer},
title = {Optimal Lossless Compression of a Class of Dynamic Sources},
booktitle = {Proc Data Compression Conference, edited by J.A. Storer and J.H. Reif. IEEE Computer Society Press, Los Alamitos, CA},
year = {1997},
pages = {501--510}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. The usual assumption for proofs of the optimality of lossless encoding is a stationary ergodic source. Dynamic sources with non-stationary probability distributions occur in many practical situations where the data source is constructed by a composition of distinct sources, for example, a document with multiple authors, a multimedia document, or the composition of distinct packets sent over a communication channel. There is a vast literature of adaptive methods used to tailor the compression to dynamic sources. However, little is known about optimal or near optimal methods for lossless compression of strings generated by sources that are not stationary ergodic. Here we do not assume the source is stationary. Instead we assume that the source produces an infinite sequence of concatenated finite strings s 1 ; s 2 ; : : : where (i) each finite string s i is generated by a sampling of a (possibly distinct) stationary ergodic source S i , and (ii) the length of each of the s i is lower b...
