Hi, may i know is it possible for us to detect the position of multiple errors in the Hamming code(15,11) using the method of parity bits.
Example:
The original transmitted hamming code is 100111010101111 but the received code is 111111011101111. SHOW how the parity bits indicate the position of the errors in the code.
Can anyone help? I unable to find back the position of the errors.
Correction capability of this code is only a single bit.
In your example there are 3 bits in error.
If the received word is a code word, the decoder does not correct any bit;
otherwise, it corrects a single bit giving the nearest (in Hemming distance) code word.
Regards
Correction capability of this code is only a single bit.
In your example there are 3 bits in error.
If the received word is a code word, the decoder does not correct any bit;
otherwise, it corrects a single bit giving the nearest (in Hemming distance) code word.
Regards
Of course.
Please refer to bibliography. Not necessarily at books specifically devoted to error correcting codes. Almost all books about digital communications contain at least a chapter about the subject.
Regards