bn:00593112n
Noun Concept
Categories: Lossless compression algorithms, Binary trees, Data compression, 1952 in computer science, CS1 location test
EN
Huffman coding  Alphabetic Huffman coding  Alphabetic Huffman tree  Applications of Huffman coding  coding tree
EN
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. Wikipedia
Definitions
Relations
Sources
EN
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. Wikipedia
A data compression algorithm by David A. Huffman Wikipedia Disambiguation
Entropy encoding algorithm used for lossless data compression Wikidata
An entropy-encoding algorithm used for lossless data compression, involving a variable-length code table derived from the estimated probability of occurrence of each symbol (so that more frequent symbols take less space to store). Wiktionary