Wiki › Technique

Huffman coding

Article
From Chaipat's knowledge graph
No article has been written for this page yet; it is generated from the knowledge graph.
About Huffman coding · from Wikipedia

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 is 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".

Summary from Wikipedia ↗, CC BY-SA 4.0.
  • thealgorithm Jan 2025
    Compression: Huffman coding and run-length encoding. Text and data: cosine similarity and edit distance.
thealgorithm