On the performance of data compression algorithms based upon string matching

DOI10.1109/18.650987zbMath0905.94018OpenAlexW2160602761MaRDI QIDQ4392484

Enhui Yang, John Cronan Kieffer

Publication date: 9 February 1999

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

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

zbMATH Keywords

data compressionstring matchingrate distortion function

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (6)

Stochastic sub-additivity approach to the conditional large deviation principle ⋮ Fast gapped variants for Lempel-Ziv-Welch compression ⋮ The asymptotics of string matching probabilities for Gaussian random sequences ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Large deviations for template matching between point processes ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

This page was built for publication: On the performance of data compression algorithms based upon string matching