Hi, I am a bit lost on ideas for answering the following question: Hamming's method of error correction can only detect and correct single bit errors. However, we saw that it requires 4 additional (redundant) bits to support the 7 data bits of each ASCII character, and we consider that overhead to be excessive for normal communications. Moreover, we know that errors occur in bursts, typically 100 bits long. Consider the typical need to transmit several kilobytes, or megabytes, for a single file-transfer. How can Hamming's method be adapted to correct burst errors, without introducing an enormous overhead in additional check bits? Is your proposed mechanism practical? Could you please provide some guidance?