Coding with digits of unequal cost

DOI10.1109/18.370161zbMath0826.94008OpenAlexW2164513722MaRDI QIDQ4838702

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 codeprefix-free codesunequal letter costsnoiseless digital channel

Mathematics Subject Classification ID

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

Related Items (2)

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding ⋮ Generalized Huffman coding for binary trees with choosable edge lengths

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