摘要
低重线性码在结合方案、认证码以及秘密共享方案等方面有着极其重要的作用,因而低重线性码的设计一直是线性码的重要研究方向。该文通过选取恰当的定义集,构造了有限域Fp(p为奇素数)上的一类四重和六重线性码,利用高斯和确定了码的重量分布,并编写Magma程序进行了验证。结果表明,构造的码中存在关于Singleton界的几乎最佳码。
Due to the wide applications in association schemes,authentication codes and secret sharing schemes etc.,construction of the linear codes with a few weights is an important research topic.A class of linear codes with four-weight and six-weight over finite field Fp(p is an odd prime)is constructed by a proper selection of the defining set.The explicit weight distribution is obtained using Gauss sums,and some examples from Magma program to illustrate the validity of the conclusions are provided.The results show that these codes include almost optimal codes with respect to Singleton bound.
作者
杜小妮
吕红霞
王蓉
DU Xiaoni;LüHongxia;WANG Rong(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)
出处
《电子与信息学报》
EI
CSCD
北大核心
2019年第12期2995-2999,共5页
Journal of Electronics & Information Technology
基金
国家自然科学基金(61772022,61562077)
上海市自然科学基金(16ZR1411200)~~
关键词
线性码
认证码
重量分布
高斯和
Linear codes
Authentication codes
Weight distribution
Gauss sums