Huffman coding with non-sorted frequencies
From MaRDI portal
Publication:691643
DOI10.1007/s11786-011-0067-4zbMath1254.68121OpenAlexW2059312722MaRDI QIDQ691643
Publication date: 3 December 2012
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-011-0067-4
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Cites Work
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Robust universal complete codes for transmission and compression
- Conditions for Optimality of the Huffman Algorithm
- An application of informational divergence to Huffman codes
- Huffman codes and self-information
- On the Optimality of Huffman Trees
- Identification Entropy
- A Method for the Construction of Minimum-Redundancy Codes
- On Information and Sufficiency
- String Processing and Information Retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Huffman coding with non-sorted frequencies