CS 385

Consider a set of valid codes from a much large set of possible codes. The distance between two codes is the number of bits in which the two codes differ, and the Hamming distance is the minimal distance between any two valid codes. Why is this far more useful than the average distance between any two valid codes? 8. The following is a Hamming code: 01111010110001101010. assuming an error in only 1 bit, what is the correct code? Does it contain an error? If so, and 9. 10. When using Hamming codes to encode a very long binary message, typically the message is broken into a number of small chunks, each of which is encoded separately. There is a trade-off between using long chunks and short chunks. What is the primary advantage of using longer chunks? What is the advantage of using short chunks? What is the one key factor that would be used to decide the size chunk to use