1) Let F = 2. For n ≥ 1, consider the code C = {0^n, 1^n}, where :
0^n = 00...0.
Show that C performs the singlet bound and that, if n = 2m + 1 is odd, it is also a perfect code.
abstract algebra