Morse code | Internal Revenue Code | The Chicago Code | The Da Vinci Code | Chapter 11, Title 11, United States Code | ZIP code | source code | International Code of Zoological Nomenclature | DVD region code | Criminal Code of Canada | Uniform Code of Military Justice | code | Baudot code | Universal Product Code | United States Code | QR code | International Civil Aviation Organization airport code | Code | Zip Code Rapists | Napoleonic Code | Code of Federal Regulations | Code B | Title 10 of the United States Code | Source Code | International Air Transport Association airport code | Code of the Krillitanes | Code 42 Software | Chapter 7, Title 11, United States Code | Bible code | 1983 Code of Canon Law |
;Find: A prefix-free binary code (a set of codewords) with minimum expected codeword length (equivalently, a tree with minimum weighted path length from the root).
In the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is a technique for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured).