A how does the twodimensional parity scheme work for any giv

A) how does the two-dimensional parity scheme work for any given block of data.
B) for any pattern of four errors forming a rectangle, an error would be undetectable.
show work please

Solution

WORKING PROCEDURE

Performance can be improved by using two-dimensional parity check, which organizes the block of bits in the form of a table. We calculate the parity check bits for each row, which is equivalent to a simple parity check bit. Parity check bits are also calculated for all columns then both are sent along with the data. At the receiving end these are compared with the parity bits calculated on the received data.