[Paper Review] Z2Z4Z8-Cyclic Codes

İsmail Aydoğdu, Fatmanur Gürsoy|arXiv (Cornell University)|Apr 24, 2017

Coding theory and cryptography3 citations

TL;DR

This paper introduces and characterizes Z₂Z₄Z₈-additive and Z₂Z₄Z₈-cyclic codes, extending the theory of Z₂Z₄-additive codes. It establishes standard forms for generator and parity-check matrices, derives generator polynomials and spanning sets for cyclic codes, and presents a Gray map to relate these codes to binary linear codes. The key contribution is a complete algebraic framework for Z₂Z₄Z₈-cyclic codes with explicit construction and example of a [57,33,4] binary code via the Gray image.

ABSTRACT

In this paper we study Z2Z4Z8-additive codes, which are the extension of recently introduced Z2Z4-additive codes. We determine the standard forms of the generator and parity-check matrices of Z2Z4Z8-additive codes. Moreover, we investigate Z2Z4Z8-cyclic codes giving their generator polynomials and spanning sets. We also give some illustrative examples of both Z2Z4Z8-additive codes and Z2Z4Z8-cyclic codes.

Motivation & Objective

• To extend the theory of Z₂Z₄-additive codes to Z₂Z₄Z₈-additive codes over three rings: Z₂, Z₄, and Z₈.
• To determine the standard forms of generator and parity-check matrices for Z₂Z₄Z₈-additive codes.
• To define and characterize Z₂Z₄Z₈-cyclic codes using generator polynomials and spanning sets.
• To establish a generalized Gray map from Z₂Z₄Z₈-codes to binary linear codes.
• To provide illustrative examples of both additive and cyclic Z₂Z₄Z₈-codes, including a [57,33,4] binary code.

Proposed method

• Define Z₂Z₄Z₈ as a Z₈-module with component-wise addition and Z₈-scalar multiplication.
• Introduce Z₂Z₄Z₈-additive codes as subgroups of Z₂^α × Z₄^β × Z₈^θ, with type classification based on invariant factors.
• Construct a generalized Gray map φ = (φ₁, φ₂) mapping Z₄ → Z₂² and Z₈ → Z₂⁴ to transform Z₂Z₄Z₈-codes into binary codes.
• Characterize Z₂Z₄Z₈-cyclic codes as ideals in the ring R = Z₂[x]/⟨x^α−1⟩ × Z₄[x]/⟨x^β−1⟩ × Z₈[x]/⟨x^θ−1⟩.
• Derive generator polynomials and spanning sets using factorization of x^n−1 and ideal structure over the rings.
• Apply the Gray map to the cyclic code generator to obtain a binary linear code with parameters [57,33,4].

Experimental results

Research questions

• RQ1 What is the standard form of the generator matrix for a Z₂Z₄Z₈-additive code, and how is it determined by the code's type?
• RQ2 How can Z₂Z₄Z₈-cyclic codes be characterized algebraically using generator polynomials and spanning sets?
• RQ3 What is the structure of the dual code of a Z₂Z₄Z₈-additive code, and how is it related to the original code?
• RQ4 How does the generalized Gray map transform Z₂Z₄Z₈-codes into binary linear codes, and what parameters do they achieve?
• RQ5 Can explicit examples of Z₂Z₄Z₈-cyclic codes be constructed, and what are the parameters of their binary Gray images?

Key findings

• The standard form of the generator matrix for a Z₂Z₄Z₈-additive code is fully characterized by its type (α,β,θ;k₀;k₁,k₂;k₃,k₄,k₅), with explicit block structure.
• The parity-check matrix of a Z₂Z₄Z₈-additive code is derived from the generator matrix using the standard form, ensuring duality and error-detection properties.
• Z₂Z₄Z₈-cyclic codes are ideals in the ring R = Z₂[x]/⟨x^α−1⟩ × Z₄[x]/⟨x^β−1⟩ × Z₈[x]/⟨x^θ−1⟩, with generator polynomials derived from factorization of x^n−1.
• The spanning set of a Z₂Z₄Z₈-cyclic code is constructed from generator polynomials f(x), g₁(x), g₂(x), and r(x), with relations involving h_p(x), h_q(x), and h₁(x).
• The Gray image of a Z₂Z₄Z₈-cyclic code is a binary linear code; in the example, the image of a Z₂Z₄Z₈-cyclic code is a [57,33,4] binary code.
• An explicit example is constructed with generator matrix in standard form, and its Gray image yields a [57,33,4] binary code, demonstrating the construction's feasibility and utility.