Optimal universal coding with respect to the maximal individual relative redundancy criterion
In this paper, methods of optimal constructions of fixed-to-variable length and variable-to-fixed length codes universal with respect to the criteria of maximal individual relative redundancy for the same source sets, for many classes of stationary sources are proposed, and their properties are studied. In particular, simple bounds for this redundancy are obtained. It is shown that for the set of binary memoryless sources, if the number of encoded messages is the same then variable-to-fixed length codes are more efficient than fixed-to-variable length codes.
- Twice-universal coding
- Methods of constructing lower bounds for redundancy of universal coding
- Relative-redundancy universal coding of memoryless sources
- Robust universal complete codes for transmission and compression
- Individual redundancy of adaptive and weighted source coding
- On a class of multilevel universal source coding schemes
- Minimax optimal universal codeword sets
- Universal coding with minimum probability of codeword length overflow
- Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
- Regular universal codeword sets (Corresp.)
- scientific article; zbMATH DE number 4095371 (Why is no real title available?)
- Efficient universal noiseless source codes
- Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
- scientific article; zbMATH DE number 3463524 (Why is no real title available?)
- Universal redundancy rates do not exist
- Some notes on Varn coding
- Relative uniformity of sources and the comparison of optimal code costs
- scientific article; zbMATH DE number 1517063 (Why is no real title available?)
- Universal variable-to-fixed length source codes
- Average-sense optimality and competitive optimality for almost instantaneous VF codes
- Universal codes for finite sequences of integers drawn from a monotone distribution
- Universal noiseless coding
- A strong version of the redundancy-capacity theorem of universal coding
- Hierarchical universal coding
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- On bounded redundancy of universal codes
- A lower-bound for the maximin redundancy in pattern coding
This page was built for publication: Optimal universal coding with respect to the maximal individual relative redundancy criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2388474)
