The Lee weight distributions of several classes of linear codes over $\mathbb{Z}_4$
Information Theory
2025-02-18 v1 math.IT
Abstract
Let denote the ring of integers modulo . The Galois ring GR, which consists of elements, represents the Galois extension of degree over . The constructions of codes over have garnered significant interest in recent years. In this paper, building upon previous research, we utilize the defining-set approach to construct several classes of linear codes over by effectively using the properties of the trace function from GR to . As a result, we have been able to obtain new linear codes over with good parameters and determine their Lee weight distributions. Upon comparison with the existing database of codes, our construction can yield novel linear codes, as well as linear codes that possess the best known minimum Lee distance.
Cite
@article{arxiv.2502.10697,
title = {The Lee weight distributions of several classes of linear codes over $\mathbb{Z}_4$},
author = {Zhexin Wang and Nian Li and Xiangyong Zeng and Xiaohu Tang},
journal= {arXiv preprint arXiv:2502.10697},
year = {2025}
}