Bounds on Data Compression Ratio with a Given Tolerable Error Probability

DOI10.1017/S0269964800005143MaRDI QIDQ4266369zbMATH OpenOpenAlexFDO

Authors I. Sadeh

Publication date 30 September 1999

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800005143

zbMATH Keywords

boundscompression rateCramer's functionsdata compressionerror probabilitylarge deviationsShannon's theory

Mathematics Subject Classification ID

Large deviations (60F10) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34) Error probability in coding theory (94B70)

Recommendations

• scientific article; zbMATH DE number 763790
• scientific article; zbMATH DE number 3793923
• Epsilon Entropy and Data Compression
• Selected data compression: a refinement of Shannon's principle
• Source coding, large deviations, and approximate pattern matching

Cites work

• A coding theorem for discrete-time sources
• A Mathematical Theory of Communication
• A sandwich proof of the Shannon-McMillan-Breiman theorem
• An Asymptotic Theory of Large Deviations for Markov Jump Processes
• Coding of sources with unknown statistics--I: Probability of encoding error
• Computation of channel capacity and rate-distortion functions
• Error exponent for source coding with a fidelity criterion
• Handbook of stochastic methods for physics, chemistry and natural sciences.
• scientific article; zbMATH DE number 3649136 (Why is no real title available?)
• scientific article; zbMATH DE number 3512673 (Why is no real title available?)
• scientific article; zbMATH DE number 4116450 (Why is no real title available?)
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• Process definitions of distortion-rate functions and source coding theorems
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• Sliding-block source coding
• The error exponent for the noiseless encoding of finite ergodic Markov sources
• The Individual Ergodic Theorem of Information Theory
• The source coding theorem revisited: A combinatorial approach
• The strong ergodic theorem for densities: Generalized Shannon-McMillan- Breiman theorem
• Universal almost sure data compression

Cited in

(13)

• Selected data compression: a refinement of Shannon's principle
• On data compression and recovery for sequences using constraints on the spectrum range
• Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
• scientific article; zbMATH DE number 5968919 (Why is no real title available?)
• Lossless Data Compression Via Error Correction
• Compression and hadamard power inequalities
• Error-Resilient Optimal Data Compression
• Compression ratio boundaries for predictive signal compression
• scientific article; zbMATH DE number 3793923 (Why is no real title available?)
• scientific article; zbMATH DE number 763790 (Why is no real title available?)
• The Rate-Distortion Risk in Estimation From Compressed Data
• Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression
• Improving the compression rate versus \(L^{1}\) error ratio in cell-average error control algorithms

This page was built for publication: Bounds on Data Compression Ratio with a Given Tolerable Error Probability

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