Lee Distance of cyclic codes of length 2 over F2m + uF2m + u2F2m

Abstract

Let p be a prime number and and m be a positive integers. Let R = F2m + uF2m + u2F2m (u3 = 0). Cyclic codes of length 2 over R are precisely the ideals of the local ring R[x] x2-1 . The Gray map from a code of Lee weight over Z4 to a code with Hamming weight over F2 is known to preserve weight. In this paper, we determine the Lee distance of cyclic codes of length 2 over R.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…