One Cyclic Codes over Fpk + vFpk + v2Fpk + ... + vrFpk
Abstract
In this paper, we investigate cyclic code over the ring Fpk + vFpk + v2Fpk + ... + vrFpk, where vr+1=v, p a prime number, r>1 and (r,p)=1, we prove as generalisation of P. Sol\'e et al. in 2015 that these codes are principally generated, give generator polynomial and idempotent depending on idempotents over this ring as response to an open problem related by J. QIAN et al. in 2005. we also give a gray map and proprieties of the related dual code.
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.