Second-order noiseless source coding theorems
From MaRDI portal
Recommendations
Cited in
(18)- Selected data compression: a refinement of Shannon's principle
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
- Formalization of Shannon's theorems
- Hurst index of functions of long-range-dependent Markov chains
- Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
- Noiseless coding of binary finite-order Markov sources (Corresp.)
- scientific article; zbMATH DE number 4160636 (Why is no real title available?)
- Folklore in Source Coding: Information-Spectrum Approach
- Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
- scientific article; zbMATH DE number 3930883 (Why is no real title available?)
- The source coding theorem via Sanov's theorem (Corresp.)
- A large deviation theory proof of the abstract alphabet source coding theorem
- The entropy theorem via coding bounds
- The role of the asymptotic equipartition property in noiseless source coding
- Source Coding Theory
- Estimation of Entropy and Mutual Information
- Weighted past and paired dynamic varentropy measures, their properties, usefulness and inferences
- Renewal theory in the analysis of tries and strings
This page was built for publication: Second-order noiseless source coding theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345640)