Morse code | Internal Revenue Code | The Chicago Code | The Da Vinci Code | Chapter 11, Title 11, United States Code | ZIP code | source code | New Kids on the Block | International Code of Zoological Nomenclature | DVD region code | Criminal Code of Canada | Uniform Code of Military Justice | code | Baudot code | Universal Product Code | Server Message Block | Nick Jr. (block) | United States Code | QR code | International Civil Aviation Organization airport code | Code | Zip Code Rapists | Napoleonic Code | Ken Block | 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 |
In the problem of decoding Reed–Solomon codes, the inputs are pair wise distinct evaluation points ’s (i = 1, . . ., n) where with dimension and distance and a codeword = .
In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere-packing bound or the volume bound from an interpretation in terms of packing balls in the Hamming metric into the space of all possible words.