Revision as of 03:40, 7 April 2002 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,177 edits entropy encoding algorithm ← Previous edit		Revision as of 15:47, 25 April 2002 edit undo Jlinton (talk \| contribs) 8 edits mNo edit summary Next edit →
Line 1: <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 [[Data compression/Shannon-Fano coding\|Shannon-Fano coding]] and falls . The text to be compressed is considered as a [[string]] of symbols. Symbols that are likely to be frequent are represented by a short sequence of [[bit]]s, and symbols that are likely to be rare are represented by a longer sequences of bits.

Huffman coding: Difference between revisions