Encyclopedia > Data compression Shannon-Fano coding

  Article Content

Shannon-Fano coding

Redirected from Data compression/Shannon-Fano coding

Shannon-Fano coding in data compression is a variable-length encoding based on the frequency of each character. The most frequent character is assigned 0, the next is assigned 10, the next 110, etc.

Shannon-Fano is a minimal prefix code. Huffman coding is optimal for character encoding (one character-one code word) and simple to program. Arithmetic coding is better still, since it can allocate fractional bits, but more complicated.

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article
Digital Rights Management

... devices. The Trusted Computing Platform Architecture scheme proposed by Intel and others is an example. So are several laws proposed or already enacted in vario ...

This page was created in 59.8 ms