Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
From MaRDI portal
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68Wxx) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)
Recommendations
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- Pointwise redundancy in lossy data compression and universal lossy data compression
- Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
- Compression using lossless decimation: analysis and application
- On the amount of statistical side information required for lossy data compression
- Reconciling Data Compression and Kolmogorov Complexity
- scientific article; zbMATH DE number 3932242
- Toward an abstract theory of data compression
- On the redundancy of universal lossless coding for general piecewise stationary sources
- An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
Cited in
(7)- Asymptotic average redundancy of Huffman (and other) block codes
- scientific article; zbMATH DE number 2086237 (Why is no real title available?)
- A One-to-One Code and Its Anti-Redundancy
- Bounding the Compression Loss of the FGK Algorithm
- Using Lossless Data Compression in Data Storage Systems: Not for Saving Space
- scientific article; zbMATH DE number 3326139 (Why is no real title available?)
- Analytic Information Theory
This page was built for publication: Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593745)
