Relative uniformity of sources and the comparison of optimal code costs

DOI10.1109/18.259659MaRDI QIDQ4307389zbMATH OpenOpenAlexFDO

Authors Julia Abrahams, Marc J. Lipman

Publication date 3 October 1994

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.259659

zbMATH Keywords

Shannon entropyHuffman codeuniform sourceRényi entropyprobability distributions of two sources

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Huffman-type codes for infinite source distributions
• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• The Renyi redundancy of generalized Huffman codes

Cited in

(8)

• scientific article; zbMATH DE number 4090556 (Why is no real title available?)
• Bernstein polynomials and learning theory
• Source coding with escort distributions and Rényi entropy bounds
• Bounding the Average Length of Optimal Source Codes Via Majorization Theory
• A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes
• scientific article; zbMATH DE number 3932941 (Why is no real title available?)
• Coding Combinatorial Sources With Costs
• Bit probabilities of optimal binary source codes

This page was built for publication: Relative uniformity of sources and the comparison of optimal code costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307389)