An algorithm for source coding subject to a fidelity criterion, based on string matching

DOI10.1109/18.256495zbMath0784.94008OpenAlexW2132906487MaRDI QIDQ4277146

Michael Gutman, Y. Steinberg

Publication date: 7 February 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.256495

zbMATH Keywords

data compressionLempel-Ziv algorithmrate distortion theoryrecurrence timesuniversal source coding

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (4)

Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Optimal data compression algorithm ⋮ Universal Data Compression Algorithm Based on Approximate String Matching ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

This page was built for publication: An algorithm for source coding subject to a fidelity criterion, based on string matching