More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

DOI10.1109/TIT.2008.926326MaRDI QIDQ3604768zbMATH OpenOpenAlexFDO

Authors Jian Li, Mordecai J. Golin

Publication date 24 February 2009

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

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

Mathematics Subject Classification ID

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

Recommendations

• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
• Faster algorithm for designing optimal prefix-free codes with unequal letter costs
• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• Prefix codes: equiprobable words, unequal letter costs

Cited in

(6)

• Bounding the inefficiency of length-restricted prefix codes
• Efficient and compact representations of some non-canonical prefix-free codes
• Coding with digits of unequal cost
• Faster algorithm for designing optimal prefix-free codes with unequal letter costs
• On the construction of prefix-free and fix-free codes with specified codeword compositions
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

This page was built for publication: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

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