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:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 42; no. 3; pp. 822 - 836
Main Authors: Zhang, Zhen, Yang, En-hui
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!
Be the first to leave a comment!
You must be logged in first