Universal almost sure data compression

DOI10.1214/aop/1176990840zbMath0699.94004OpenAlexW2067345628MaRDI QIDQ913771

Paul C. Shields, Donald S. Ornstein

Publication date: 1990

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176990840

zbMATH Keywords

decoderdata compressionbinary sequencesdistortionsource codingergodic processn-codeZiv-Lempel algorithm

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (7)

Bounds on Data Compression Ratio with a Given Tolerable Error Probability ⋮ Algorithmic complexity of points in dynamical systems ⋮ Compression and entropy ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ 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

This page was built for publication: Universal almost sure data compression