1. What is the probability of block error of the (N, K) Hamming code to leading order, when the code is used for a binary symmetric channel with noise density f?
2. Prove that there exist families of codes with ‘bad' distance that are ‘very good' codes.