Revision as of 15:47, 25 April 2002 edit Jlinton (talk \| contribs) 8 edits mNo edit summary ← Previous edit		Revision as of 10:22, 28 May 2002 edit undo Jlinton (talk \| contribs) 8 edits Fixed some wierdness Next edit →
Line 2: 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