Build Hamming Error Correction Code Directions:

Build an error correcting code for encoding a set of 50 distinct symbols (i.e., a, b, c, d. . .). How many bits do you need to be able to efficiently represent them for storage in a computer? The error correcting code should be able to fix one error (use the Hamming ECC described in the 2nd part of the lecture). Submit a file called ERROR_CORRECTING_CODE.txt containing the description of the steps employed to build the code similarly to the steps described in the slides. It should contain the correspondence between elements/bits of a (input values) and elements/bits of b (coded values), with subscripts in binary. Bit indexes start from 1 (considered to be the least significant bit).

For example, the lines: b_001 <- a_1 + a_2 + .. (would tell that bit 1 of the output contains the XOR of bits 1 and 2 of the input) b_011 <- a_1 (would tell that bit 3 of the output contains the first bit of the input) A note to help you on the assignment: For 50 symbols, you need only ... bits. So don't use a_1 to a_50. The example given in the lecture could encode 211 -11-1 symbols! You need only 50. You need the ... bits plus the parity bits and that is it.

*** This is not a programming language question. This is supposed to be a created matrix (made up of 1's and 0's) in order to perform this problem.