1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

[Coding theory]

  1. Oct 25, 2011 #1
    1. The problem statement, all variables and given/known data
    The question is as follows:
    Give the appearing weights of the generalized Hamming codes H(4) and H(5). Also give the amount of code words per weight.


    2. Relevant equations
    The generalized Hammingcode is defined code existing of all h [itex]\in [/itex] F[itex]^{n}_{2}[/itex] which satisfy h . v = 0 for each v as a row of matrix Q. Where Q contains as colums all the possible words in F[itex]^{m}_{2}[/itex] except for the zero word.


    3. The attempt at a solution

    Obviously this leads to finding the enumerating polynomials of those codes, and maybe use Mac Williams identity along the way. Yet I can't seem to find a way to do this.
     
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?



Similar Discussions: [Coding theory]
  1. Group Theory (Replies: 0)

  2. Graph Theory (Replies: 0)

  3. Measure theory (Replies: 0)

  4. Cyclic Codes over Z3 (Replies: 0)

Loading...