To overcome the limitation of simple parity check, we can use two

dimensional parity check

Performance can be improved by using two dimensional parity checks or

block parity

which organizes the block of bits in the form of table.

 1 0 0 1 0 0
1 0 0 0 0 1
1 1 0 0 0 1
1 1 1 1 0 1

Data block are organized into table.

6 column.

4 rows.
 Lets take an example

We have 3 rows and 5 columns

1 1 1 0 0
0 1 1 0 1
1 0 0 1 0
 Add parity bit to last column for each row

Add parity bit to last Row for each column

1 1 1 0 0 1
0 1 1 0 1 1
1 0 0 1 0 0
0 0 0 1 1
 Single bit error

1 0 1 0 0
0 1 0 1 0
1 0 1 0 0

Calculating Parity bits

1 0 1 0 0 0
0 1 0 1 0 0
1 0 1 0 0 0
0 1 0 1 0
 Data transfer from transmitters end to receivers end with calculated even
parity

1 0 1 0 0 0
0 0 0 1 0 0
1 0 1 0 0 0
0 1 0 1 0

2nd column and 2nd row not maintain parity bit

 Burst error

1 1 0 0 0
0 0 1 0 0
0 1 0 0 1

Calculating Parity bits

1 1 0 0 0 0
0 0 1 0 0 1
0 1 0 0 1 0
1 0 1 0 1
 Data transfer from transmitters end to receivers end with calculated even
parity

1 1 0 0 0 0
1 1 1 0 0 1
0 1 0 0 1 0
1 0 1 0 1

First two data bits change from 0,0 to 1,1 in 2nd row