(2) encode each byte with additional bits. The received bits can match against the encoding pattern. The closest matching pattern is the transmitted byte. This is how hamming code works.
(3) two dimensional parity ones the text in 2 dimensional block. Then take a checksum across the row and down the column. This allows to pinpoint the byte that has changed (error). The byte can be recomputed from the vertical and horizontal checksum. In reverse.
No comments:
Post a Comment