Huffman coding with unequal letter costs
From MaRDI portal
Publication:3579254
DOI10.1145/509907.510020zbMath1192.68899OpenAlexW2078591209MaRDI QIDQ3579254
Neal E. Young, Mordecai J. Golin, Claire M. 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
Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25)
Related Items
Dynamic Shannon coding, 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
