Shannon–Fano coding
In the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is a name given to two different but related techniques for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). Shannon–Fano coding should not be confused with Shannon–Fano–Elias coding (also known as Elias coding), the precursor to arithmetic coding.
- Comment
- enIn the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is a name given to two different but related techniques for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). Shannon–Fano coding should not be confused with Shannon–Fano–Elias coding (also known as Elias coding), the precursor to arithmetic coding.
- Depiction
- Has abstract
- enIn the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is a name given to two different but related techniques for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). * Shannon's method chooses a prefix code where a source symbol is given the codeword length . One common way of choosing the codewords uses the binary expansion of the cumulative probabilities. This method was proposed in Shannon's "A Mathematical Theory of Communication" (1948), his article introducing the field of information theory. * Fano's method divides the source symbols into two sets ("0" and "1") with probabilities as close to 1/2 as possible. Then those sets are themselves divided in two, and so on, until each set contains only one symbol. The codeword for that symbol is the string of "0"s and "1"s that records which half of the divides it fell on. This method was proposed in a later technical report by Fano (1949). Shannon–Fano codes are suboptimal in the sense that they do not always achieve the lowest possible expected codeword length, as Huffman coding does. However, Shannon–Fano codes have an expected codeword length within 1 bit of optimal. Fano's method usually produces encoding with shorter expected lengths than Shannon's method. However, Shannon's method is easier to analyse theoretically. Shannon–Fano coding should not be confused with Shannon–Fano–Elias coding (also known as Elias coding), the precursor to arithmetic coding.
- Is primary topic of
- Shannon–Fano coding
- Label
- enShannon–Fano coding
- Link from a Wikipage to an external page
- archive.org/details/fano-tr65.7z
- archive.org/details/ost-engineering-shannon1948
- Link from a Wikipage to another Wikipage
- A Mathematical Theory of Communication
- Arithmetic coding
- Bell System Technical Journal
- Binary number
- Category:Claude Shannon
- Category:Lossless compression algorithms
- Claude Shannon
- Data compression
- David A. Huffman
- Entropy (information theory)
- File:HuffmanCodeAlg.png
- File:ShannonCodeAlg.svg
- Floor and ceiling functions
- Huffman coding
- Information theory
- Optimization (mathematics)
- Prefix code
- Priority queue
- Probabilities
- Robert Fano
- Shannon's source coding theorem
- Shannon–Fano–Elias coding
- Statistical independence
- Technical report
- Zip (file format)
- SameAs
- 2Ug1p
- Codage de Shannon-Fano
- Codificação de Shannon-Fano
- Codificación Shannon-Fano
- Kodowanie Shannona-Fano
- m.0gx4v
- Q2645
- Shannon-Fano-Kodierung
- Shannonovo–Fanovo kódování
- Алгоритм Шеннона — Фано
- Алгоритм Шеннона — Фано
- Շենոն-Ֆանոյի կոդավորում
- קוד שאנון-פאנו
- ترميز شانون وفانو
- رمزگذاری شانون-فانو
- การเข้ารหัสแชนนอน–ฟาโน
- シャノン・ファノ符号化
- 香农-范诺编码
- 샤논-파노 부호화
- Subject
- Category:Claude Shannon
- Category:Lossless compression algorithms
- Thumbnail
- WasDerivedFrom
- Shannon–Fano coding?oldid=1115172689&ns=0
- WikiPageLength
- 19100
- Wikipage page ID
- 62544
- Wikipage revision ID
- 1115172689
- WikiPageUsesTemplate
- Template:Cite journal
- Template:Main
- Template:Reflist
- Template:Short description
