MacWilliams Equivalence Theorem for the Lee Weight over ℤ 4 1

Aleams Barra · Malaysian Journal of Science · 2015

For codes over fields, the MacWilliams equivalence theorem give us a complete characterization when two codes are equivalent.Considering the important role of the Lee weight in coding theory, one would like to have a similar results for codes over integer residue rings equipped with the Lee weight.We would like to prove that the linear isomorphisms between two codes in ℤ m n that is preserving the Lee weight are exactly the maps of the formThe problem is still largely open.Wood proved the result for codes over ℤ n where n is a power of 2 or 3.In this paper we prove the result for prime n of the form 41 p  where p is prime.

Read the paper · More papers on PaperTik