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

On $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic (1611.03169v1)

Published 10 Nov 2016 in cs.IT and math.IT

Abstract: In this paper, we study $\mathbb{Z}{2}\mathbb{Z}{2}[u]$-$(1+u)$-additive constacyclic code of arbitrary length. Firstly, we study the algebraic structure of this family of codes and a set of generator polynomials for this family as a $(\mathbb{Z}{2}+u\mathbb{Z}{2})[x]$-submodule of the ring $R_{\alpha,\beta}$. Secondly, we give the minimal generating sets of this family codes, and we determine the relationship of generators between the $\mathbb{Z}{2}\mathbb{Z}{2}[u]$-$(1+u)$-additive constacyclic codes and its dual and give the parameters in terms of the degrees of the generator polynomials of the code. Lastly, we also study $\mathbb{Z}{2}\mathbb{Z}{2}[u]$-$(1+u)$-additive constacyclic code in terms of the Gray images.

Citations (2)

Summary

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