Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$ (1501.01327v1)

Published 6 Jan 2015 in cs.IT and math.IT

Abstract: In this paper, we have studied cyclic codes over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u2=0$. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over $R$ to be a $\mathbb{Z}_4$-free module is presented. We have provided the general form of the generators of a cyclic code over $R$ and determined a formula for the ranks of such codes. In this paper we have mainly focused on principally generated cyclic codes of odd length over $R$. We have determined a necessary condition and a sufficient condition for cyclic codes of odd lengths over $R$ to be $R$-free.

Summary

We haven't generated a summary for this paper yet.