At most three-weight binary linear codes from generalized Moisio’s exponential sums

被引：1
作者：
Yansheng Wu
Qin Yue
Xueying Shi
机构：
[1] Nanjing University of Aeronautics and Astronautics,Department of Mathematics
[2] State Key Laboratory of Cryptology,undefined
来源：
Designs, Codes and Cryptography | 2019年 / 87卷
关键词：
Binary linear codes; Gauss sums; Gauss periods; Secret sharing schemes; 11T71; 11T24;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we evaluate two classes of new exponential sums, which are viewed as generalized Moisio’s exponential sums in contrast to the results by Heng and Yue (IEEE Commun Lett 19:1488–1491, 2015) and Moisio (Finite Fields Appl 15:644–651, 2009). As applications, we present two classes of binary linear codes with two wights or three weights. These codes can be used in secret sharing schemes and authentication codes.
引用
收藏
页码：1927 / 1943
页数：16
相关论文
共 68 条
  • [1] Anderson AR(1998)How to build robust shared control systems Des. Codes Cryptogr. 15 111-124
  • [2] Ding C(2005)Linear codes from perfect nonlinear mappings and their secret sharing schemes IEEE Trans. Inf. Theory 51 2089-2102
  • [3] Helleseth T(2016)A construction of binary linear codes from Boolean functions Discret. Math. 339 2288-2303
  • [4] Kløve T(2015)Linear codes from some 2-designs IEEE Trans. Inf. Theory 61 3265-3275
  • [5] Carlet C(2007)A general construction of Cartesian authentication codes IEEE Trans. Inf. Theory 53 2229-2235
  • [6] Ding C(2013)Hamming weights in irreducible cyclic codes Discret. Math. 313 434-446
  • [7] Yuan J(2014)Binary linear codes with three weights IEEE Commun. Lett. 18 1879-1882
  • [8] Ding C(2015)A class of two-weight and three-weight codes and their applications in secret sharing IEEE Trans. Inf. Theory 61 5835-5842
  • [9] Ding C(2015)A class of binary linear codes with at most three weights IEEE Commun. Lett. 19 1488-1491
  • [10] Ding C(2016)Two classes of two-weight linear codes Finite Fields Appl. 38 72-92
1234567