Theorem 3.1: Suppose that C is a t-error correcting code in Z₂ⁿ. Then |C|*(++...+) 2ⁿ

Theorem 3.3: Suppose r is the number of codewords in an (n,d) code for some n,d with d > n/2. Then r 2d/2d-n Using Theorem 3.1 find the maximum number of bit errors that are guaranteed to be uniquely correctable in a code of length 7 with 4 codewords. Then using Theorem 3.3, show that it is actually not possible to construct a code of length 7 with 4 codewords that is guaranteed to uniquely correct this number of bit errors