| |
| | Error-Correcting Codes |
 | | As the Golay code uses a block of 23 bits, with 12 bits used for data (and therefore 2^12 possible valid codewords), and it corrects three errors, which means that the minimum Hamming distance between valid codewords is 7, it is referred to as a [23,12,7] code. |
 | | Fourth, assume that exactly one bit in the error-checking portion of the block is in error, and for each of the 12 bits in the error-checking portion, invert that bit, apply the code to the result, and compare the error-checking portion of the output to the data portion of the recieved block. |
 | | BCH codes are based on primitive polynomials in the Galois Field over 2^n, which were discussed earlier in the sections on the Rijndael block cipher, and on linear-feedback shift registers, and in a section of their own. |
| www.quadibloc.com /crypto/mi0602.htm (7187 words) |
|