Papers
Topics
Authors
Recent
Search
2000 character limit reached

On cyclic codes over Zq+uZq\mathbb{Z}_q+u\mathbb{Z}_q

Published 16 Jan 2015 in cs.IT and math.IT | (1501.03924v4)

Abstract: Let R=Zq+uZqR=\mathbb{Z}_q+u\mathbb{Z}_q, where q=p<sup>sq=p<sup>s and u<sup>2=0u<sup>2=0. In this paper, some structural properties of cyclic codes over the ring RR are considered. A necessary and sufficient condition for cyclic codes over the ring RR to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.