Huffman coding
Topic history | v1 (current) | created by janarez
Details
Huffman coding
see v1 | created by janarez | Add topic "Huffman coding"
- Title
- Huffman coding
- Description
- 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. The process of finding or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes". The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols.
- Link
- https://en.wikipedia.org/?curid=13883
resources
treated in Huffman Coding
treated in Huffman Coding
authors
This topic has no history of related authors.