Complete weight enumerators of two classes of linear codes

详细信息    查看全文

• 作者：Qiuyan Wang^a ; ^c ; ^{wangyan198801@163.com} ; Fei Li^b ; ^{cczxlf@163.com} ; Kelan Ding^c ; ^{dingkelan@iie.ac.cn} ; Dongdai Lin^c ; ^{ddlin@iie.ac.cn}
• 关键词：Linear codes ; Complete weight enumerator ; Gauss sum
• 刊名：Discrete Mathematics
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：340
• 期：3
• 页码：467-480
• 全文大小：475 K
• 卷排序：340

文摘

Recently, linear codes with a few weights have been constructed and extensively studied. In this paper, for an odd prime pp, we determine the complete weight enumerator of two classes of pp-ary linear codes constructed from defining set. Our results show that the codes have at most seven weights and may have applications in secret sharing schemes.