Bit probabilities of optimal binary source codes

DOI10.1109/18.59942MaRDI QIDQ3199315zbMATH OpenOpenAlexFDO

Authors B. L. Montgomery, Harvey Diamond, B. V. K. Vijaya Kumar

Publication date 1990

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

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

zbMATH Keywords

memoryless sourceoptimal binary source encoderuniform sources

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 4063000
• Optimum '1'-ended binary prefix codes
• On the average codeword length of optimal binary codes for extended sources (Corresp.)
• Optimal source coding for a class of integer alphabets (Corresp.)
• Relative uniformity of sources and the comparison of optimal code costs

Cited in

(7)

• Minimum breakdown degradation in binary source encoding
• Efficient Integer Coding for Arbitrary Probability Distributions
• Optimal random coding
• The threshold probability of a code
• Generating probabilities with a specified entropy
• Bernstein polynomials and learning theory
• Efficiency of chain codes to represent binary objects

This page was built for publication: Bit probabilities of optimal binary source codes

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