A suboptimal lossy data compression based on approximate pattern matching

DOI10.1109/18.623143MaRDI QIDQ4371886zbMATH OpenOpenAlexWikidataFDO

Authors 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 matchingcompression ratelossless Lempel-Ziv data compression schemelossy data compressionsource coding algorithmstationary mixing sequencestypical length

Mathematics Subject Classification ID

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

Recommendations

• Source coding, large deviations, and approximate pattern matching
• On the performance of data compression algorithms based upon string matching
• Pattern matching and lossy data compression on random fields
• scientific article; zbMATH DE number 868046

Cited in

(20)

• The asymptotics of waiting times between stationary processes, allowing distortion
• Optimal data compression algorithm
• Stochastic sub-additivity approach to the conditional large deviation principle
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• Shortest distance between multiple orbits and generalized fractal dimensions
• Longest common substring for random subshifts of finite type
• Matching strings in encoded sequences
• Random databases with approximate record matching
• On the performance of data compression algorithms based upon string matching
• Universal lossless compression via multilevel pattern matching
• Natural type selection in adaptive lossy compression
• The asymptotics of string matching probabilities for Gaussian random sequences
• Source coding, large deviations, and approximate pattern matching
• Pattern matching and lossy data compression on random fields
• An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
• Rényi entropy and pattern matching for run-length encoded sequences
• The Rényi entropy function and the large deviation of short return times
• Universal Data Compression Algorithm Based on Approximate String Matching
• Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy
• On approximate pattern matching for a class of Gibbs random fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371886)