Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 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

Negacyclic codes over Z4+uZ4 (1412.3751v1)

Published 11 Dec 2014 in cs.IT and math.IT

Abstract: In this paper, we study negacyclic codes of odd length and of length $2k$ over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u2=0$. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set for negacyclic codes of odd lengths over $R$. A necessary and sufficient condition for negacyclic codes of odd lengths to be free is presented. We have determined the cardinality of negacyclic codes in each case. We have obtained the structure of the duals of negacyclic codes of length $2k$ over $R$ and also characterized self-dual negacyclic codes of length $2k$ over $R$.

Citations (2)

Summary

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