2000 character limit reached
On cyclic codes over
Published 16 Jan 2015 in cs.IT and math.IT | (1501.03924v4)
Abstract: Let , where and . In this paper, some structural properties of cyclic codes over the ring are considered. A necessary and sufficient condition for cyclic codes over the ring to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.
Paper Prompts
Sign up for free to create and run prompts on this paper.