Linear Codes over $\mathbb{F}_{q}+u\mathbb{F}_{q}$ associated with Simplicial Complexes, Their Gray Images, and Subfield Codes

2026-09-10

AI Summary

本文使用单纯复形构造了线性码，通过指数和技巧确定了Lee重量分布，并利用Gray映射得到了最优距离码及其子域码。

Abstract

In recent years, simplicial complexes have gained considerable attention as a useful tool for constructing distance-optimal codes over finite fields. In this article, we construct four infinite families of linear codes over the ring $\mathcal{R}=\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^2=0$ using simplicial complexes with one or two maximal elements, and completely determine their Lee weight distributions via exponential-sum techniques. By employing a Gray map on $\mathcal{R}$, we obtain infinite families of distance-optimal codes over $\mathbb{F}_{q}$, including a near-Griesmer family, and establish sufficient conditions for their minimality. Furthermore, we investigate the corresponding subfield codes and derive sufficient conditions for their distance-optimality and minimality, yielding infinite families of Griesmer and near-Griesmer codes.

Problem

• Simplicial Complexes
• Linear Codes
• Distance-Optimal
• Gray Map
• Subfield Codes

Innovation

• Simplicial Complexes
• Linear Codes
• Gray Map
• Subfield Codes
• Distance-Optimal