| The
Distance |
|
|
|
|
|
|
|
|
|
|
| n | Hamming Distance
is the number of differences |
||||||||
| between code
words. |
|||||||||
| e.g. d (1101, 0101) = 1 |
|||||||||
| d (0000, 0111) = 3 |
|||||||||
| n | Minimum
distance (dmin): the min no of |
||||||||
| differences
between any two code words |
|||||||||
| n | Adding redundant
bits limits the number of code |
||||||||
| words used.
Hence, increasing the minimum |
|||||||||
| distance between
them |
|||||||||
