scientific article; zbMATH DE number 4063000

MaRDI QIDQ3797104zbMATH OpenFDO

Authors Toby Berger, Raymond W. Yeung

Publication date 1988

zbMATH Keywords

minimum average code word lengthoptimum code

Mathematics Subject Classification ID

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

Recommendations

• Optimum '1'-ended binary prefix codes
• 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

(15)

• Mathematical optimization and the synchronizing properties of encodings
• Codes with monotonic codeword lengths
• Optimum extensions of prefix codes.
• Bit probabilities of optimal binary source codes
• Optimum '1'-ended binary prefix codes
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• On the average codeword length of optimal binary codes for extended sources (Corresp.)
• Binary prefix codes ending in a "1"
• Optimal Prefix Codes And Huffman Codes
• 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?)
• Optimal binary one-ended codes
• Optimal Binary Coding of Ordered Numbers
• An optimum encoding with minimum longest code and total number of digits

This page was built for publication:

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