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 : Inequivalent design.

  1. Feb 29, 2012 #1
    Construct two inequivalent 2-(16,6,2) designs. Show that they are inequivalent by proving that one cannot obtained from the other by any permutations of the rows or columns of the incidence array or by showing that the codes produced by the span of the rows have different parameters.

    I have construct 2-(16,6,2) design. How to show they are inequivalent. Can someone helps?
    A = (0 0 1 1) C = (0 1 1 0)
    (0 0 1 1) (1 0 0 1)
    (1 1 0 0) (1 0 0 1)
    (1 1 0 0) (0 1 1 0)

    B = (0 1 0 1) D = (0 0 0 0)
    (1 0 1 0) (0 0 0 0)
    (0 1 0 1) (0 0 0 0)
    (1 0 1 0) (0 0 0 0)


    First Design
    M = ( A B C D )
    ( B A D C )
    ( C D A B )
    ( D C B A )

    E = neg(A)
    Second Design
    N = (E B C D)
    ( B A D C )
    ( C D A B )
    ( D C B A )

    How to show M and N are inequavient.
     
  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 : Inequivalent design.
  1. Graph Theory (Replies: 0)

  2. Measure theory (Replies: 0)

  3. Cyclic Codes over Z3 (Replies: 0)

  4. [Coding theory] (Replies: 0)

Loading...