2000 character limit reached
On cyclic codes over $\mathbb{Z}_q+u\mathbb{Z}_q$ (1501.03924v4)
Published 16 Jan 2015 in cs.IT and math.IT
Abstract: Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.