Skew cyclic codes over Fp+uFp+… +uk-1Fp

Abstract

In this article, we study the skew cyclic codes over Rk=Fp+uFp+… +uk-1Fp of length n. We characterize the skew cyclic codes of length n over Rk as free left Rk[x;θ]-submodules of Rk[x;θ]/ xn-1 and construct their generators and minimal generating sets. Also, an algorithm has been provided to encode and decode these skew cyclic codes.

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…