We propose an original approach to investigate the linearity of $\mathbb{Z}_{2^L}$-linear codes, i.e., codes obtained as the image of the generalized Gray map applied to $\mathbb{Z}_{2^L}$-additive codes. To accomplish that, we define two related binary codes: the associated and concatenated, where one could perform a straightforward analysis of the Schur product between their codewords and determine the linearity of the respective $\mathbb{Z}_{2^L}$-linear code. This work expands on previous contributions from the literature, where the linearity was established with respect to the kernel of a code and/or operations on $\mathbb{Z}_{2^L}$. The $\mathbb{Z}_{2^L}$-additive codes we apply the Gray map and check the linearity are the well-known Hadamard, simplex, and MacDonald codes. We also present families of Reed-Muller and cyclic codes that yield to linear $\mathbb{Z}_{2^L}$-linear codes and perform a computational verification of our proposed method applied to other $\mathbb{Z}_{2^L}$-additive codes.

翻译：暂无翻译