A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

DOI10.1109/18.850708zbMATH Open1002.94015OpenAlexW2159266843MaRDI QIDQ4503603FDOQ4503603

Authors: Sze-Lok Chan, Mordecai J. Golin 

Publication date: 7 September 2000

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

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

Recommendations

• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
• scientific article; zbMATH DE number 4063000
• Optimum '1'-ended binary prefix codes
• A generic top-down dynamic-programming approach to prefix-free coding
• scientific article; zbMATH DE number 1305081
• Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
• Faster algorithm for designing optimal prefix-free codes with unequal letter costs
• Optimal prefix free codes with partial sorting

zbMATH Keywords

dynamic programmingalgorithmHuffman-encoding problemminimum cost prefix-free codeone-ended codes

Mathematics Subject Classification ID

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

Cited In (6)

• Design and analysis of dynamic Huffman codes
• Title not available (Why is that?)
• Binary prefix codes ending in a "1"
• A generic top-down dynamic-programming approach to prefix-free coding
• Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries
• Optimum '1'-ended binary prefix codes

This page was built for publication: A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

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