A Class of Binary Linear Codes With at Most Three Weights

In this letter, we use Gauss sums of index 2 to construct a class of new binary linear codes with at most three weights. In special cases, they are optimal or near optimal codes. These codes can be used in authentication codes and secret sharing schemes.

[1]  H. Niederreiter,et al.  Two-Weight Codes Punctured from Irreducible Cyclic Codes , 2008 .

[2]  Jing Yang,et al.  Complete solving of explicit evaluation of Gauss sums in the index 2 case , 2009, 0911.5472.

[3]  K. Williams,et al.  Gauss and Jacobi sums , 2021, Mathematical Surveys and Monographs.

[4]  Cunsheng Ding,et al.  Linear Codes From Some 2-Designs , 2015, IEEE Transactions on Information Theory.

[5]  Jürgen Neukirch.  Class Field Theory , 1986 .

[6]  Lei Hu,et al.  The weight distribution of a class of p-ary cyclic codes , 2010, Finite Fields Their Appl..

[7]  Cunsheng Ding,et al.  Binary Linear Codes With Three Weights , 2014, IEEE Communications Letters.

[8]  Cunsheng Ding,et al.  A coding theory construction of new systematic authentication codes , 2005, Theor. Comput. Sci..

[9]  Chengju Li,et al.  Hamming Weights of the Duals of Cyclic Codes With Two Zeros , 2014, IEEE Transactions on Information Theory.

[10]  Cunsheng Ding,et al.  A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing , 2015, IEEE Transactions on Information Theory.

[11]  Cunsheng Ding,et al.  Hamming weights in irreducible cyclic codes , 2011, Discret. Math..

[12]  Cunsheng Ding,et al.  Secret sharing schemes from three classes of linear codes , 2006, IEEE Transactions on Information Theory.

[13]  Chengju Li,et al.  Weight distributions of cyclic codes with respect to pairwise coprime order elements , 2013, Finite Fields Their Appl..