W**********U
发帖数: 132 | 1 Sorry that I could not type Chinese at this moment.
I am reading a book and it has the following statement about error-
correcting code: "While it is easy to construct Hamming code that can
sustain one error, it is pretty inefficient to generate an error-correcting
code that contains n bits per block and still survive, say, n - 2 errors."
Does "survive" mean correcting here? If yes, can somebody give a CONCRETE
example of error-correcting code that contains n bits per block and can "
survive" n - 2 errors? It does not matter whether it is efficient or not.
Thanks. |
|
