arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.11282cs.ITmath.IT
收藏

由Weil和导出的几类少重量线性码

Several classes of linear codes with few weights derived from Weil sums

Zhao Hu, Mingxiu Qiu, Nian Li, Xiaohu Tang, Liwei Wu

AI总结:

本文利用Weil和与Gauss和,构造了有限域上由集合交、差、并定义的几类少重量线性码,完全确定其参数与重量分布,并得到三类达到Griesmer界的最优码。

摘要:

少重量线性码在秘密共享、认证码、结合方案和强正则图中有应用。本文提出了有限域 ${\mathbb F}_{q}$ 上的几类 $t$-重量线性码,其定义集由两个特定集合的交、差和并给出,其中 $t=3,4,5,6$ 且 $q$ 为奇素数幂。利用Weil和与Gauss和,完全确定了这些码的参数和重量分布。此外,得到了三类达到Griesmer界的最优码,计算机实验表明,从我们的构造中可以导出许多(几乎)最优的码。

英文摘要:

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with the defining sets given by the intersection, difference and union of two certain sets, where $t=3,4,5,6$ and $q$ is an odd prime power. By using Weil sums and Gauss sums, the parameters and weight distributions of these codes are determined completely. Moreover, three classes of optimal codes meeting the Griesmer bound are obtained, and computer experiments show that many (almost) optimal codes can be derived from our constructions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑