Huffman coding with unequal letter costs

DOI10.1145/509907.510020MaRDI QIDQ3579254zbMATH OpenOpenAlexFDO

Authors Neal E. Young, Mordecai J. Golin, Claire Kenyon

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.510020

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25) Linear codes (general theory) (94B05)

Cited in

(4)

• Approximation Algorithms for Key Management in Secure Multicast
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• An approximation algorithm for binary searching in trees
• Dynamic Shannon coding

This page was built for publication: Huffman coding with unequal letter costs

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