Linear equivalence of codes

MacWilliams theorem

Let 𝜑 :C →C′ be a linear isomorphism between [𝑛,𝑘] codes C,C′. Then if the generalized Hamming weight wt𝑡⁡(D) =wt𝑡⁡(𝜑(D)) for every 𝑡-dimensional linear subcode D ≤C, then 𝜑 is a Linear equivalence of codes.1

Proof

#missing/proof


#state/develop | #lang/en | #SemBr

Footnotes

  1. 2011. On the equivalence of linear codes ↩