The entropy theorem via coding bounds
From MaRDI portal
Recommendations
Cited in
(23)- A note on coding theorems of information theory
- An axiomatic derivation of the coding-theoretic possibilistic entropy
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- A Shannon-McMillan theorem for motley names
- Entropy and Source Coding for Integer-Dimensional Singular Random Variables
- scientific article; zbMATH DE number 4160636 (Why is no real title available?)
- scientific article; zbMATH DE number 4169343 (Why is no real title available?)
- Entropy encoding, Hilbert space, and Karhunen-Loève transforms
- scientific article; zbMATH DE number 3920365 (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
- Entropy and data compression schemes
- Second-order noiseless source coding theorems
- scientific article; zbMATH DE number 4121928 (Why is no real title available?)
- A strong version of the redundancy-capacity theorem of universal coding
- Metric and Topological Entropy Bounds for Optimal Coding of Stochastic Dynamical Systems
- scientific article; zbMATH DE number 3893089 (Why is no real title available?)
- scientific article; zbMATH DE number 6280500 (Why is no real title available?)
- scientific article; zbMATH DE number 5208524 (Why is no real title available?)
- An application of rate-distortion theory to a converse to the coding theorem
- On a generalized entropy and a coding theorem
- Entropy preservation under Markov coding.
- The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
This page was built for publication: The entropy theorem via coding bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987460)