Linear Codes over the Finite Ring <i>Z</i><sub>15</sub>

Wensheng Li, Lingyu Wan, Meng-tian Yue, Wei Chen, Xuedong ZhangAdvances 2020 · DOI

In the field of algebraic coding theory, the transition from finite fields to finite rings has opened new avenues for constructing efficient error-correcting codes. This paper, originally published in Advances in Linear Algebra & Matrix Theory, investigates the algebraic structure of the non-chain ring $\mathbb{Z}_{15}$ and its application to linear codes. By utilizing the Chinese Remainder Theorem (CRT), the researchers establish a framework for defining Lee weights and Gray mappings that preserve critical distance properties, effectively bridging the gap between complex ring-based codes and standard linear codes.

The Challenge of Non-Chain Rings

Most classical coding theory is built upon finite fields. However, a significant breakthrough in the 1990s demonstrated that certain high-performing non-linear binary codes could be represented as linear codes when constructed over finite rings, such as $\mathbb{Z}_4$. While much of the subsequent research focused on "chain rings"—where ideals are neatly nested—this paper tackles the more complex structure of $\mathbb{Z}_{15}$.

Because $15 = 3 \times 5$, $\mathbb{Z}_{15}$ is a non-chain ring. This complexity requires a more nuanced approach to defining "weights" (the measure of how many errors a code can detect or correct) and "mappings" that translate these codes into formats compatible with standard decoders without losing their mathematical integrity.

Methodology: Decomposition and Mapping

The authors employ several key algebraic techniques to characterize the ring's structure:

1. Chinese Remainder Theorem (CRT) Decomposition

Since 3 and 5 are coprime, the ring $\mathbb{Z}_{15}$ can be decomposed into the direct sum of two smaller fields: $\mathbb{Z}_3$ and $\mathbb{Z}_5$. This allows every element $a \in \mathbb{Z}_{15}$ to be uniquely expressed in the form: $$a = 3b + 5d$$ where $b \in \mathbb{Z}_5$ and $d \in \mathbb{Z}_3$. This unique expression serves as the foundation for the paper's subsequent proofs.

2. Defining the Lee Weight

The researchers define a specific Lee weight ($W_L$) for elements in $\mathbb{Z}_{15}$ based on the CRT decomposition. If both components ($b$ and $d$) are non-zero, the weight is 2; if only one is non-zero, the weight is 1; if both are zero, the weight is 0. This provides a metric for measuring distance within the ring.

3. The Gray Mapping

A Gray mapping $\Phi$ is defined to map an element of $\mathbb{Z}_{15}$ to a pair of elements. While this doubles the length of the code, it simplifies the alphabet and allows the code to be analyzed using standard Hamming-metric tools.

Key Findings and Results

The paper's primary contribution lies in proving the relationship between the ring-based code and its image under the Gray mapping.

  • Distance Preservation: The authors formally prove that $W_L(x) = W_H(\Phi(x))$, where $W_H$ is the Hamming weight. This means that the Lee distance between two codewords in the original ring is exactly equal to the Hamming distance of their images. Consequently, a code designed for the Lee metric will perform predictably when mapped to a standard Hamming-metric space.
  • Linearity of the Gray Map: In many ring-based systems, the Gray map is non-linear, which increases the computational complexity of encoding and decoding. This paper proves that for $\mathbb{Z}_{15}$, the map $\Phi$ is linear, respecting the addition and scalar multiplication rules of the ring.
  • Code Parameters: The study demonstrates that if a code $C$ over $\mathbb{Z}_{15}$ has length $n$ and minimum distance $d$, its Gray image $\Phi(C)$ is a linear code with length $2n$ and the same minimum distance $d$.
  • Dual Code Construction: The researchers successfully constructed the generator matrix for the dual code $C^\perp$, providing the necessary mathematical framework for parity checking.

Conclusion and Future Directions

This research provides a foundational structural study of linear codes over $\mathbb{Z}_{15}$. By proving the linearity and distance-preserving nature of the Gray mapping, the authors have established that $\mathbb{Z}_{15}$ is a viable and mathematically sound environment for error-correcting codes.

Future work in this area may include the exploration of weight enumerators to find the exact distribution of weights, establishing MacWilliams identities to relate the weight distribution of a code to its dual, and investigating self-dual codes which often possess high symmetry and superior error-correction capabilities.

Summary updated

Abstract

In this paper, the structure of the non-chain ring Z15 is studied. The ideals of the ring Z15 are obtained through its non-units and the Lee weights of elements in Z15 are presented. On this basis, by the Chinese Remainder Theorem, we construct a unique expression of an element in Z15. Further, the Gray mapping from Zn15 to Z2n15 is defined and it’s shown to be distance preserved. The relationship between the minimum Lee weight and the minimum Hamming weight of the linear code over the ring Z15 is also obtained and we prove that the Gray map of the linear code over the ring Z15 is also linear.
BibTeX
@inproceedings{li2020linear,
  author = {Wensheng Li and Lingyu Wan and Meng-tian Yue and Wei Chen and Xuedong Zhang},
  title = {{Linear Codes over the Finite Ring \<i\>Z\</i\>\<sub\>15\</sub\>}},
  booktitle = {Advances},
  year = {2020},
  doi = {10.4236/alamt.2020.101001},
}
Figure