An on-line universal lossy data compression algorithm via continuous codebook refinement--Part II: Optimality for phi-mixing source models
Two versions of the gold-washing data compression algorithm, one with codebook innovation interval and the other with finitely many codebook innovations, were considered. The convergence speed of the algorithm is discussed.
Saved in:
| Published in: | IEEE transactions on information theory Vol. 42; no. 3; pp. 822 - 836 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
1996
|
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Two versions of the gold-washing data compression algorithm, one with codebook innovation interval and the other with finitely many codebook innovations, were considered. The convergence speed of the algorithm is discussed. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0018-9448 1557-9654 |
| DOI: | 10.1109/18.490547 |