Shannon–Fano coding
technique for constructing a prefix code
Facts
2 properties- Instance of
- entropy coding
- Named after
- Claude Shannon, Robert Fano[2][3]
🏷️ Also known as
en Shannon–Fano coding
ar ترميز شانون-فانو
cs Shannonovo-Fanovo kódování
de Huffman-Codierung
de Huffman-Kode
de Huffman-Kodierung
de Huffman-Verfahren
de Shannon-Fano-Codierung
de Shannon-Fano-Kodierung
de Shannon-Fano-Code
de Fano-Code
de Huffman-Code
es algoritmo de Huffman
es Codificacion Shannon Fano
es Codificacion Shannon-Fano
fa رمزگذاری شانون-فانو
fi Shannonin–Fanon koodaus
fr Codage de Shannon-Fano
he קוד שאנון-פאנו
it Codifica Shannon-Fano
🔖 Identifiers · 5
- OpenAlex ID
- C130811719
- Dictionary of Algorithms and Data Structures ID
- shannonFano
- File Format Wiki page ID
- Shannon–Fano_coding
- Freebase ID
- /m/0gx4v
- Microsoft Academic ID (discontinued)
- 130811719
🔗 Connections
Named after 2
Instance of 1
← Resistance in Belgium ID 1
← SNARC ID 1
Press Enter · cited answer in seconds
0 sources
Summary
Shannon–Fano coding is an entropy coding[1].
Body
History and Context
Things named after include Claude Shannon[2], a mathematician[4], 1916–2001[5], of United States[6], awarded the Stuart Ballantine Medal[7], specialised in probability theory[8] and Robert Fano[3], a computer scientist[9], 1917–2016[10], of United States[11], awarded the Claude E. Shannon Award[12], specialised in computer science[13].