Lesson 3

If \(d=n\), then there can be no more than two codewords. Indeed, take any codeword \(s \in C\). Any other codeword must differ from it in all \(n\) bits, and there is exactly one such word. Moreover, constructing a code of size two is easy—it suffices to take any two words that differ in all bits.