 Converting the index of
the 1 bit
locations into a
binary number
 Perform the
XOR operations
on all resulting binary numbers
 If the
result = 0 then
the messages
(most likely) contains
no error
 The decoded message
consists of the
received bits
minus the
bits at
at positions:
2^{0},
2^{1},
2^{2}, ...,
2^{k}

 If the
result <= length of the message then
the messages (most likely)
contains
1 error
 Change the
value of the bit at
the position given by
"result"
(computed above)
 The decoded message
consists of the
received bits
minus the
bits at
at positions:
2^{0},
2^{1},
2^{2}, ...,
2^{k}

 If the
result > length of the message then
the messages
(most likely)
contains
multiple errors
 The receiver cannot perform
correction
 It will reject the
message as corrupted

