Revision as of 04:49, 6 December 2003 edit Ojigiri~enwiki (talk \| contribs) 1,319 edits m +ja ← Previous edit		Revision as of 00:28, 14 December 2003 edit undo Noldoaran (talk \| contribs) 1,291 edits disamb string Next edit →
Line 7: The basic idea is borrowed from an older and slightly less efficient method called [[Shannon-Fano coding]]. The text to be compressed is considered as a [[Literal string\|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