- #1
squaremeplz
- 124
- 0
Homework Statement
Let C be a 2 error correcting code based on the binary alphabet {0,1}. suppose that the length of each codeword is n.. What is the max number of codewords that this code may have
Homework Equations
The Attempt at a Solution
I'm having a real tough time understanding this concept. My guess from combinatorics is that there are 2^(n) valid codewords? There are no restrictions imposed by this problem as to what kind of codeing is used (i.e. Parity, repetition,etc) so this is my best guess.