The weight distribution of a class of two-weight linear codes derived from Kloosterman sums

Linear codes with few weights have applications in data storage systems, secret sharing schemes, and authentication codes. In this paper, a class of p-ary two-weight linear codes is constructed using a generic construction developed by Ding et al. recently, where p is a prime. Their length and weight distribution are closed-form expressions of Kloosterman sums over prime finite fields, and are completely determined when p = 2 and p = 3. The dual of this class of linear codes is also studied and is shown to be optimal or almost optimal in the binary case.

[1]  Cunsheng Ding,et al.  Linear codes from perfect nonlinear mappings and their secret sharing schemes , 2005, IEEE Transactions on Information Theory.

[2]  Torleiv Kløve,et al.  Codes for Error Detection , 2007, Series on Coding Theory and Cryptology.

[3]  Harald Niederreiter,et al.  Finite fields: Author Index , 1996 .

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

[5]  Qin Yue,et al.  Two classes of two-weight linear codes , 2016, Finite Fields Their Appl..

[6]  L. Carlitz.  Kloosterman sums and finite field extensions , 1969 .

[7]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[8]  Gregor Leander,et al.  Monomial bent functions , 2006, IEEE Transactions on Information Theory.

[9]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[10]  A. Calderbank,et al.  THREE-WEIGHT CODES AND ASSOCIATION SCHEMES , 2014 .

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

[12]  Rui Xue,et al.  Binary Linear Codes With Two Weights , 2015, IEEE Communications Letters.

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

[14]  Dongmei Huang,et al.  Binary Linear Codes With Few Weights , 2016, IEEE Communications Letters.

[15]  Cunsheng Ding,et al.  How to Build Robust Shared Control Systems , 1998, Des. Codes Cryptogr..

[16]  Cunsheng Ding,et al.  A Generic Construction of Cartesian Authentication Codes , 2007, IEEE Transactions on Information Theory.

[17]  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.

[18]  Qin Yue,et al.  A Class of Binary Linear Codes With at Most Three Weights , 2015, IEEE Communications Letters.

[19]  Tor Helleseth,et al.  Monomial and quadratic bent functions over the finite fields of odd characteristic , 2006, IEEE Transactions on Information Theory.