An algorithm for source coding subject to a fidelity criterion, based on string matching
- 1 May 1993
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (3) , 877-886
- https://doi.org/10.1109/18.256495
Abstract
A practical, suboptimal universal block source coding scheme, subject to a fidelity criterion, is proposed. The algorithm is an extension of the Lempel-Ziv algorithm and is based on string matching with distortion. It is shown that given average distortion D > 0, the algorithm achieves a rate not exceeding R(D/2) for a large class of sources and distortion measures. Tighter bounds on the rate are derived for discrete memoryless sources and for memoryless Gaussian sources.Keywords
This publication has 12 references indexed in Scilit:
- Strong converses in source coding relative to a fidelity criterionIEEE Transactions on Information Theory, 1991
- A unified approach to weak universal source codingIEEE Transactions on Information Theory, 1978
- Variable-rate universal block source coding subject to a fidelity constraintIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Fixed rate universal block source coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterionIEEE Transactions on Information Theory, 1972
- A geometric treatment of the source encoding of a Gaussian random variableIEEE Transactions on Information Theory, 1968
- Measure TheoryPublished by Springer Nature ,1950
- On the notion of recurrence in discrete stochastic processesBulletin of the American Mathematical Society, 1947