On cyclic codes over mathbb{Z}_q+umathbb{Z}_q
classification
💻 cs.IT
math.IT
keywords
mathbbcodescyclicringbch-typeboundconditionconsidered
read the original abstract
Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, where $q=p^s$ and $u^2=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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.