Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 174 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 98 tok/s Pro
Kimi K2 190 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

$(1+2u)$-constacyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$ (1504.03445v1)

Published 14 Apr 2015 in math.RA, cs.IT, and math.IT

Abstract: Let $R=\mathbb{Z}4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u2=0$. In the present paper, we introduce a new Gray map from $Rn$ to $\mathbb{Z}{4}{2n}.$ We study $(1+2u)$-constacyclic codes over $R$ of odd lengths with the help of cyclic codes over $R$. It is proved that the Gray image of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic codes of length $2n$ over $\mathbb{Z}_4$. Further, a number of linear codes over $\mathbb{Z}_4$ as the images of $(1+2u)$-constacyclic codes over $R$ are obtained.

Citations (2)

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Questions

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.