[Paper Review] Propelinear structure of Z_{2k}-linear codes

Joaquim Borges, Cristina Fernández-Córdoba+1 more|ArXiv.org|Jul 30, 2009

Coding theory and cryptography7 references3 citations

TL;DR

This paper introduces a unique Gray map Φ that transforms Z_{2k}-linear codes into binary propelinear codes, preserving Lee distance as Hamming distance. It proves that under this map, Z_{2k}-codes become propelinear but not translation-invariant for k > 2, and uses this to show that 1-perfect binary mixed group codes must be of type (Z_k^2, Z_{(n-k)/2}^4), ruling out higher-order components.

ABSTRACT

Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a Gray map $Φ:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $Φ(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, $Φ$ is the unique Gray map such that $Φ(C)$ is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.

Motivation & Objective

• To establish a canonical Gray map from Z_{2k}-linear codes to binary propelinear codes.
• To characterize the structural properties of Z_{2k}-codes under this map, particularly their non-translation-invariance for k > 2.
• To investigate the existence of 1-perfect binary mixed group codes using the proposed Gray map framework.
• To determine the necessary type constraints for 1-perfect codes in the mixed group code setting.
• To analyze the information rate degradation when mapping Z_{2k}-codes to binary codes via the Gray map.

Proposed method

• Define a Gray map Φ: Z_{2k}^n → Z_{2k}^n such that Φ(C) is a binary propelinear code for any additive subgroup C ⊆ Z_{2k}^n.
• Prove that Φ is the unique Gray map preserving Hamming-compatibility and distance structure between Z_{2k} and binary space.
• Use the map to transform Z_{2k}-codes into binary codes and analyze their group code properties.
• Apply the transformation to mixed group codes of the form Z_{k_1}^{2^{i_1}} × ⋯ × Z_{k_r}^{2^{i_r}}.
• Analyze the 1-perfect code condition by assuming existence of components with i_j > 2 and deriving a contradiction via distance and weight arguments.
• Use coordinate permutation invariance and weight-preserving properties to show uniqueness of the map up to permutation.

Experimental results

Research questions

• RQ1 Is there a canonical Gray map that transforms Z_{2k}-linear codes into binary propelinear codes while preserving distance structure?
• RQ2 Can Z_{2k}-codes be represented as Hamming-compatible group codes via a unique Gray map?
• RQ3 Are there 1-perfect binary mixed group codes that include components beyond Z_2 and Z_4?
• RQ4 What structural constraints must a 1-perfect mixed group code satisfy in terms of component types?
• RQ5 How does the information rate change when mapping Z_{2k}-codes to binary codes via the proposed Gray map?

Key findings

• The proposed Gray map Φ is the unique map from Z_{2k}^n to Z_{2k}^n such that Φ(C) is a Hamming-compatible group code for any additive subgroup C ⊆ Z_{2k}^n.
• For k > 2, the image Φ(C) of any Z_{2k}-code C is a propelinear code that is not translation-invariant.
• The information rate R′ of the binary image Φ(C) is R′ = (1 + log₂k)/k × R, which is strictly less than R for k ≥ 3.
• Any 1-perfect binary mixed group code must be of type (Z_k^2, Z_{(n-k)/2}^4) for some k ∈ ℕ, ruling out components with i_j > 2.
• The existence of a 1-perfect code with a component isomorphic to Z_6 leads to a contradiction due to distance inconsistencies in codeword neighborhoods.
• The proof relies on showing that if a component Z_{2^{i_j}} with i_j > 2 exists, then the required codeword distribution for 1-perfectness fails due to non-unique or non-minimal distance relations.