Huffman coding with non-sorted frequencies

DOI10.1007/S11786-011-0067-4MaRDI QIDQ691643zbMATH OpenOpenAlexFDO

Authors Shmuel T. Klein, Dana Shapira

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

zbMATH Keywords

Burrows-Wheler transformdata compressiondynamic compressionHuffman codingpartial sorting

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms (68W40)

Recommendations

• In-place calculation of minimum-redundancy codes
• Constructing Huffman Trees in Parallel
• Approximating Huffman codes in parallel
• scientific article; zbMATH DE number 2086676
• Dynamic huffman coding

Cites work

• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
• A Method for the Construction of Minimum-Redundancy Codes
• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• An application of informational divergence to Huffman codes
• Conditions for Optimality of the Huffman Algorithm
• Evaluation of parallel text alignment systems -- the ARCADE project
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• scientific article; zbMATH DE number 1975048 (Why is no real title available?)
• Huffman codes and self-information
• Identification Entropy
• On Information and Sufficiency
• On the Optimality of Huffman Trees
• Robust universal complete codes for transmission and compression

Cited in

(5)

• Huffman sequences with uniform time energy distribution
• Compressed matching for feature vectors
• Effect of file size, entropy and alphabet size on Huffman algorithm performance
• Constructing binary Huffman tree
• First come first served for online slot allocation and Huffman coding

This page was built for publication: Huffman coding with non-sorted frequencies

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