Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Error correction

  1. Dec 12, 2008 #1
    1. The problem statement, all variables and given/known data

    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

    2. Relevant equations

    3. 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.
  2. jcsd
  3. Dec 12, 2008 #2


    User Avatar
    Science Advisor

    That's pretty trivial isn't it? Yes, exactly as you say, there are 2n codewords. The part about about "2 error correcting" (and I have no idea what that is) is not used.
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook