Linear codes over the ring Z4 + uZ4 + vZ4 + wZ4 + uvZ4 + uwZ4 + vwZ4 + uvwZ4

Abstract

We investigate linear codes over the ring Z4 + uZ4 + vZ4 + wZ4 + uvZ4 + uwZ4 + vwZ4 + uvwZ4, with conditions u2=u, v2=v, w2=w, uv=vu, uw=wu and vw=wv. We first analyze the structure of the ring and then define linear codes over this ring. Lee weight and Gray map for these codes are defined and MacWilliams relations for complete, symmetrized, and Lee weight enumerators are obtained. The Singleton bound as well as maximum distance separable codes are also considered. Furthermore, cyclic and quasi-cyclic codes are discussed, and some examples are also provided.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…