Coding with digits of unequal cost

DOI10.1109/18.370161MaRDI QIDQ4838702zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert

Publication date 4 December 1995

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

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

zbMATH Keywords

dynamic programming algorithmHuffman codenoiseless digital channelprefix-free codesunequal letter costs

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Dynamic programming (90C39) Source coding (94A29)

Recommendations

• Prefix Codes: Equiprobable Words, Unequal Letter Costs
• scientific article; zbMATH DE number 1305081
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• Prefix codes: equiprobable words, unequal letter costs

Cited in

(5)

• Coding with asymmetric numeral systems
• Generalized Huffman coding for binary trees with choosable edge lengths
• On One-to-One Codes for Memoryless Cost Channels
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• Code Offset in the Exponent.

This page was built for publication: Coding with digits of unequal cost

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