Optimum '1'-ended binary prefix codes

DOI10.1109/18.59940MaRDI QIDQ3199322zbMATH OpenOpenAlexFDO

Authors Toby Berger, Raymond W. Yeung

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.59940

zbMATH Keywords

binary prefix code of minimum average codeword lengthLower and upper bounds

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 4063000
• Binary prefix codes ending in a "1"
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• Optimal binary one-ended codes
• A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

Cited in

(13)

• Optimum extensions of prefix codes.
• Bit probabilities of optimal binary source codes
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• scientific article; zbMATH DE number 3910298 (Why is no real title available?)
• scientific article; zbMATH DE number 4063000 (Why is no real title available?)
• Binary prefix codes ending in a "1"
• Optimal prefix codes for sources with two-sided geometric distributions
• A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
• scientific article; zbMATH DE number 1543071 (Why is no real title available?)
• Average-sense optimality and competitive optimality for almost instantaneous VF codes
• Optimal binary one-ended codes
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• Optimal Binary Coding of Ordered Numbers

This page was built for publication: Optimum '1'-ended binary prefix codes

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