Efficient prefix coding of uncertainty spaces
From MaRDI portal
Recommendations
- Efficient and Compact Representations of Prefix Codes
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Uncertainty spaces. Entropy and the coding theorem
- The Price of Uncertain Priors in Source Coding
- Deterministic compression with uncertain priors
- Optimal probabilistic dense coding schemes
- Deterministic compression with uncertain priors
- Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables
- scientific article; zbMATH DE number 3930882
- Bounding the inefficiency of length-restricted prefix codes
Cites work
- scientific article; zbMATH DE number 3807501 (Why is no real title available?)
- Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
- Information spaces: Notions of proper information and uncertainty
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Uncertainty spaces. Entropy and the coding theorem
- Uncertainty theory: Purpose, first results, prospects. II
Cited in
(6)- On coding of underdetermined sequences with a fidelity criterion
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
- Partitions and singular transformations of Shannon uncertainty spaces. II
- Uncertainty spaces. Entropy and the coding theorem
- Information spaces: Notions of proper information and uncertainty
This page was built for publication: Efficient prefix coding of uncertainty spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905215)
