源自单纯复形的少重量最优线性码
Optimal linear codes with few weights from simplicial complexes
AI总结:
该研究利用含单个极大元的有限域上单纯复形,在有限环上构造四类线性码并确定其参数与重量分布,通过Gray映射得到有限域上的多类最优线性码,推广了已有结果。
摘要:
近年来,利用单纯复形构造最优线性码的研究受到广泛关注,已有多项相关优秀成果发表。设$q$为素数幂。本文利用${\fF}_{q}^m$中仅含单个极大元的单纯复形,在环${\fF}_{q}+u{\fF}_{q}$($u^2=0$)上构造了四类线性码,推广了[IEEE Trans. Inf. Theory 66(6):3657-3663, 2020]中的结果。本文完全确定了这四类码的参数与Lee重量分布。尤为值得注意的是,通过Gray映射,我们得到了若干类${\fF}_{q}$上的最优线性码,包括(近)Griesmer码和距离最优码。
英文摘要:
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb F}_{q}^m$ with one single maximal element, we construct four families of linear codes over the ring ${\mathbb F}_{q}+u{\mathbb F}_{q}$ ($u^2=0$), which generalizes the results of [IEEE Trans. Inf. Theory 66(6):3657-3663, 2020]. The parameters and Lee weight distributions of these four families of codes are completely determined. Most notably, via the Gray map, we obtain several classes of optimal linear codes over ${\mathbb F}_{q}$, including (near) Griesmer codes and distance-optimal codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。