Huffman coding: Difference between revisions

Content deleted Content added
No edit summary
Line 1:
In [[computer science]], <b>Huffman coding</b> (A Method for the Construction of Minimum-Redundancy Codes 1952) is an [[entropy encoding]] [[algorithm]] used for [[data compression]].
 
The basic idea is borrowed from an older and slightly less efficient method called