Lect 15 Errors in Crossbars
CSCI 2570
@John E Savage
27
Balanced Hamming Distance
Consider two error-free
codewords, ca and cb.
Let |ca - cb]
denote the number of inputs for which caj = 1 and cbj = 0.The balanced
Hamming distance (BHD) between ca and cb is 2min(|ca - cb],
|cb - ca]).If ca and cb have a BHD of 2d + 2 they can collectively
tolerate up to d errors.
