Efficient prefix coding of uncertainty spaces
In classical information theory the codeword length is a random variable, and a given code is regarded as efficient if the expected codeword length is sufficiently small. The information-theoretical notion of efficient coding, however, is neither the only possible one nor the best in any specific sense. Thus, many coding applications require minimizing not the expectation of codword length but the expectation of some function of this length. Other cases require minimizing the quantity which is not an expectation at all, for instance, the maximum codeword length or the total sum of lengths of all codewords. There are, of course, also more complex requirements, which do not fit the information-theoretical partial definition of efficiency. We show that the notion of uncertainty space [cf. ibid. 29, No. 4, 606-612 (1993; Zbl 0812.60002)]\ makes it possible to replace the many partial definitions of efficient code with one general definition, and then apply the apparatus of uncertainty spaces to solve efficient coding problems. The present paper is also closely related to the paper reviewed below, which provides various examples of interpretation of uncertainty spaces that can be applied to the corresponding coding problems.
- 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
- Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
- scientific article; zbMATH DE number 3807501 (Why is no real title available?)
- 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
- 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
- On coding of underdetermined sequences with a fidelity criterion
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)
