A suboptimal lossy data compression based on approximate pattern matching

DOI10.1109/18.623143zbMath0953.94012OpenAlexW2142509031WikidataQ105584734 ScholiaQ105584734MaRDI QIDQ4371886

Tomasz Łuczak, Wojciech Szpankowski

Publication date: 14 January 2001

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

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

zbMATH Keywords

approximate string matchingstationary mixing sequencescompression ratelossy data compressionlossless Lempel-Ziv data compression schemesource coding algorithmtypical length

Mathematics Subject Classification ID

Searching and sorting (68P10) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (12)

Stochastic sub-additivity approach to the conditional large deviation principle ⋮ R\'enyi entropy and pattern matching for run-length encoded sequences ⋮ Matching strings in encoded sequences ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Random databases with approximate record matching ⋮ The Rényi entropy function and the large deviation of short return times ⋮ Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy ⋮ On approximate pattern matching for a class of Gibbs random fields ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ Optimal data compression algorithm ⋮ Longest common substring for random subshifts of finite type ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

This page was built for publication: A suboptimal lossy data compression based on approximate pattern matching