Several Classes of Two-weight or Three-weight Linear Codes and Their Applications
Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].
Weil sumLinear codeComplete weight enumeratorMinimal codeStrongly regular graph
沈红艳、刘海波
展开 >
成都信息工程大学应用数学学院,成都,610066
Weil和 线性码 完全重量计数器 极小码 强正则图
Natural Science Foundation of ChinaSichuan Natural Science Foundation
万方数据
