CRC checksum algorithm?

Question

the information content of a bit pattern is 1010101010101011. Using an even parity scheme algorithm, derive the value of the checksum field of a two-dimentional parity scheme. Minimum-length checksum field should be use. two-dimensional parity checks can correct and detect? can a double-bit error be detected and corrected?

Answer 1

Reshape the 16 bits as a 4 by 4 array.
1010
1010
1010
1011
Draw parity along 2 edges at right angles to each other.
1010 0
1010 0
1010 0
1011 1

0001

Even parity means that you must have an even number of "one" bits in each row and column (including the parity bit.).
This will give you 8 extra bits.
It can correct single bit errors but not double bit errors.
It can only detect double bit errors.
To correct n bit errors you need to form an n +1 dimensional array with the corresponding increase in overhead.
The layout of the checksum bits would have to be to a standard. (Rows first? Columns first?)

Answer 2

1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1

16384,8192,4096,2048,1024,512,256,128,64,32,16,8,4,2,1
each one means that you take the value of it. just read the numbers from left to right.

after that add the numbers
32768+8192+2048+512+128+32+8+2+1= 43691