I think I understand the Hamming code encoding process. But there is no where for me to verify my understanding effectively. So, I want to grab a random binary string and perform the encoding process here for you to comment on whether my encoding is correct. Assume the data is 1101. Place the data in the empty slots: P1 P2 P3 P4 P5 P6 P7 0 0 1 0 1 0 1 Calculate parity bits: - P1 = (0 + 1 + 1 + 1) % 2 = 1 - P2 = (0 + 1 + 0 + 1) % 2 = 0 - P4 = (0 + 1 + 0 + 1) % 2 = 1 Therefore, the result of the Hamming code for the data is 1011101.

ANONYMOUS wrote: Keep in mind that Hamming's mechanism (algorithm) requires the original input data to be 7 bits long, to calculate 4 checkbits, and to 'merge' the data and checkbits together to form a total of 11 output bits. From our Resources page [CITS3002]⬈ you can download the simple program demonstrated in Lecture-2, compile it (the command is provided as a comment in the code), and then compare its reported result with your manually calculated result. Hope that helps,

Hi Chris, Thanks for the reply. I am just being curious about why the code has to be 11-bit long. Would 10-bit or 12-bit defeat the purpose?