In principle, there is a technique to find
parity in both vertical and horizontal
. In this way, the error information can be effectively higher than the parity bit.
1. a block of bits build a friendship trough
2.To calculate the parity bits of data, each row and each column collections
.
การแปล กรุณารอสักครู่..
