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.
Uloženo v:
| Vydáno v: | IEEE transactions on information theory Ročník 42; číslo 3; s. 822 - 836 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
1996
|
| Témata: | |
| ISSN: | 0018-9448, 1557-9654 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | 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 |