Error correcting codes
Terminology:
- Frame consists of m message bits + r redundant or checkbits. n = r + m
- n bit unit consisting of data + checkbits is called a codeword
- Hamming distance - 0010 XOR 1101 = 1111, i.e., the number of bit positions at which two codewords differ is called the Hamming distance.
- If two codewords are a Hamming distance d apart, it takes d single bit errors to convert one to another.