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

Z2Z4-additive cyclic codes, generator polynomials and dual codes (1406.4425v3)

Published 17 Jun 2014 in cs.DM, cs.IT, and math.IT

Abstract: A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2\alpha\times{\mathbb{Z}}_4\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of ${\mathbb{Z}}_4$ coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. These codes can be identified as submodules of the $\mathbb{Z}_4[x]$-module $\mathbb{Z}_2[x]/(x\alpha-1)\times\mathbb{Z}_4[x]/(x\beta-1)$. The parameters of a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive cyclic code are stated in terms of the degrees of the generator polynomials of the code. The generator polynomials of the dual code of a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive cyclic code are determined in terms of the generator polynomials of the code ${\cal C}$.

Citations (61)

Summary

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