Two classes of two-weight linear codes

被引:53
作者
Heng, Ziling [1 ,2 ]
Yue, Qin [1 ,2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing 211100, Jiangsu, Peoples R China
[2] State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China
基金
中央高校基本科研业务费专项资金资助;
关键词
Gauss period; Secret sharing scheme; Linear code; Hamming weight; SECRET SHARING SCHEMES; CYCLIC CODES; WEIGHT DISTRIBUTIONS;
D O I
10.1016/j.ffa.2015.12.002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Two-weight linear codes have many wide applications in authentication codes, association schemes, strongly regular graphs, and secret sharing schemes. In this paper, we present two classes of two-weight binary or ternary linear codes. In some cases, they are optimal or almost optimal. They can also be used to construct secret sharing schemes. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:72 / 92
页数:21
相关论文
共 21 条
[11]  
Grassl M., Bounds on the minimum distance of linear codes
[12]   A Class of Binary Linear Codes With at Most Three Weights [J].
Heng, Ziling ;
Yue, Qin .
IEEE COMMUNICATIONS LETTERS, 2015, 19 (09) :1488-1491
[13]  
Li C., 2014, IEEE T INFORM THEORY, V56, P2568
[14]   The Walsh transform of a class of monomial functions and cyclic codes [J].
Li, Chengju ;
Yue, Qin .
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2015, 7 (02) :217-228
[15]   Weight distributions of cyclic codes with respect to pairwise coprime order elements [J].
Li, Chengju ;
Yue, Qin ;
Li, Fengwei .
FINITE FIELDS AND THEIR APPLICATIONS, 2014, 28 :94-114
[16]  
Liu HW, 2010, ARS COMBINATORIA, V95, P511
[17]   PERIOD POLYNOMIALS AND GAUSS SUMS FOR FINITE-FIELDS [J].
MYERSON, G .
ACTA ARITHMETICA, 1981, 39 (03) :251-264
[18]  
Niederreiter H., 1983, FINITE FIELDS
[19]   The weight distributions of two classes of binary cyclic codes [J].
Wang, Xiaoqiang ;
Zheng, Dabin ;
Hu, Lei ;
Zeng, Xiangyong .
FINITE FIELDS AND THEIR APPLICATIONS, 2015, 34 :192-207
[20]   Secret sharing schemes from three classes of linear codes [J].
Yuan, J ;
Ding, CS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) :206-212