Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
Authors:
- En-Hui YangEYEn-Hui Yang
- J.C. KiefferJKJ.C. Kieffer
- 1 January 1996
- journal article
- letter
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (1) , 239-245
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A survey of the theory of source coding with a fidelity criterionIEEE Transactions on Information Theory, 1993
- Sample converses in source coding theoryIEEE Transactions on Information Theory, 1991
- Universal Almost Sure Data CompressionThe Annals of Probability, 1990
- Fixed-rate encoding of nonstationary information sourcesIEEE Transactions on Information Theory, 1987
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- Fixed rate universal block source coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterionIEEE Transactions on Information Theory, 1972
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968