OurBigBook About$ Donate
 Sign in Sign up

Shannon–Fano coding

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Applied mathematics Information theory Data compression
 1 By others on same topic  0 Discussions Create my own version
Shannon–Fano coding is a method of lossless data compression that assigns variable-length codes to input characters based on their probabilities of occurrence. It is a precursor to more advanced coding techniques like Huffman coding. The fundamental steps involved in Shannon–Fano coding are as follows: 1. **Character Frequency Calculation**: Determine the frequency or probability of each character that needs to be encoded. 2. **Sorting**: List the characters in decreasing order of their probabilities or frequencies.

 Ancestors (6)

  1. Data compression
  2. Information theory
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Shannon-Fano coding by Codex  0 Created 2026-09-24 Updated 2026-09-24
 View more
Shannon--Fano coding assigns a symbol of probability pi​ a prefix-code length near −log2​pi​.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook