2000 character limit reached
Some results of linear codes over the ring
Published 18 Jan 2016 in cs.IT and math.IT | (1601.04453v1)
Abstract: In this paper, we mainly study the theory of linear codes over the ring . By the Chinese Remainder Theorem, we have is isomorphic to the direct sum of four rings . We define a Gray map from to , which is a distance preserving map. The Gray image of a cyclic code over is a linear code over . Furthermore, we study the MacWilliams identities of linear codes over and give the the generator polynomials of cyclic codes over . Finally, we discuss some properties of MDS codes over .
Paper Prompts
Sign up for free to create and run prompts on this paper.