On cyclic codes over Zq+uZq
Abstract
Let R=Zq+uZq, where q=ps and u2=0. In this paper, some structural properties of cyclic codes over the ring R are considered. A necessary and sufficient condition for cyclic codes over the ring R to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.
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.