Constructing binary Huffman tree

DOI10.2478/FORMA-2013-0015zbMATH Open1298.68071OpenAlexW1969274304MaRDI QIDQ467784FDOQ467784

Yuichi Futa, Yasunari Shidama, Hiroyuki Okazaki

Publication date: 5 November 2014

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/forma-2013-0015

Recommendations

• Minimal Huffman trees
• Huffman coding and chains in partition lattices
• Constructing Huffman Trees in Parallel
• Huffman coding with non-sorted frequencies
• scientific article; zbMATH DE number 436071

zbMATH Keywords

source codingformalization of Huffman coding tree

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Mechanization of proofs and logical operations (03B35)

Cites Work

• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Analysis of algorithms: an example of a sort algorithm
• Random variables and product of probability spaces

Cited In (8)

• Proof pearl: Mechanizing the textbook proof of Huffman's algorithm
• Binary Huff Curves
• Title not available (Why is that?)
• Effect of file size, entropy and alphabet size on Huffman algorithm performance
• Title not available (Why is that?)
• Term context
• Generalized Huffman tree and its application in Chinese character coding
• Constructing Huffman Trees in Parallel

This page was built for publication: Constructing binary Huffman tree

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