Relative generalized Hamming weights of cyclic codes

Abstract Relative generalized Hamming weights (RGHWs) of a linear code with respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the linear codes. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems. In this paper, we investigate the RGHWs of cyclic codes of two nonzeros with respect to its irreducible cyclic subcodes. We give two formulae for RGHWs of the cyclic codes. As applications of the formulae, explicit examples are computed. Moreover, RGHWs of cyclic codes in the examples are very large, comparing with the generalized Plotkin bound of RGHWs. So it guarantees very high security for the secret sharing scheme based on the dual codes.

[1]  Venkatesan Guruswami,et al.  List decoding from erasures: bounds and code constructions , 2001, IEEE Trans. Inf. Theory.

[2]  Ruud Pellikaan,et al.  Generalized Hamming Weights of q-ary Reed-Muller Codes , 1998, IEEE Trans. Inf. Theory.

[3]  Cunsheng Ding,et al.  A class of three-weight cyclic codes , 2013, Finite Fields Their Appl..

[4]  Keqin Feng,et al.  Weight distribution of some reducible cyclic codes , 2008, Finite Fields Their Appl..

[5]  Heeralal Janwa,et al.  On Generalized Hamming Weights and the Covering Radius of Linear Codes , 2007, AAECC.

[6]  Catherine A. Meadows,et al.  Security of Ramp Schemes , 1985, CRYPTO.

[7]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

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

[9]  G. David Forney,et al.  Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.

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

[11]  Yuan Luo,et al.  Code constructions and existence bounds for relative generalized Hamming weight , 2013, Des. Codes Cryptogr..

[12]  Dongdai Lin,et al.  Generalized Hamming Weights of Irreducible Cyclic Codes , 2014, IEEE Transactions on Information Theory.

[13]  Maosheng Xiong,et al.  The weight distributions of a class of cyclic codes II , 2011, Finite Fields Their Appl..

[14]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[15]  Olav Geil,et al.  Relative generalized Hamming weights of one-point algebraic geometric codes , 2014, ITW.

[16]  Olav Geil,et al.  Asymptotically good ramp secret sharing schemes , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[17]  A. H. Han Vinck,et al.  Some new bounds on relative generalized Hamming weight , 2011, 2011 IEEE 13th International Conference on Communication Technology.

[18]  Cunsheng Ding,et al.  The Weight Distributions of the Duals of Cyclic Codes With Two Zeros , 2011, IEEE Transactions on Information Theory.

[19]  Torleiv Kløve,et al.  The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N) , 1977, Discret. Math..

[20]  T. R. N. Rao,et al.  Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.

[21]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

[22]  Philippe Delsarte,et al.  On subfield subcodes of modified Reed-Solomon codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[23]  Kefei Chen,et al.  Some new characters on the wire-tap channel of type II , 2005, IEEE Transactions on Information Theory.

[24]  Keqin Feng,et al.  On the Weight Distributions of Two Classes of Cyclic Codes , 2008, IEEE Transactions on Information Theory.

[25]  Hao Chen,et al.  Access Structures of Elliptic Secret Sharing Schemes , 2008, IEEE Transactions on Information Theory.

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

[27]  A. Ashikhmin.  Generalized Hamming Weights for &-Linear Codes , 2015 .

[28]  Yuan Luo,et al.  The relative generalized Hamming weight of linear q-ary codes and their subcodes , 2008, Des. Codes Cryptogr..

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

[30]  Raymond W. Yeung,et al.  Network generalized hamming weight , 2009 .

[31]  Olav Geil,et al.  Relative generalized Hamming weights of q-ary Reed-Muller codes , 2014, Adv. Math. Commun..

[32]  Shu Lin,et al.  On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes , 1993, IEEE Trans. Inf. Theory.

[33]  Gennian Ge,et al.  The Weight Hierarchy of Some Reducible Cyclic Codes , 2015, IEEE Transactions on Information Theory.

[34]  Cunsheng Ding,et al.  The Weight Distribution of Some Irreducible Cyclic Codes , 2009, IEEE Transactions on Information Theory.

[35]  Hao Chen,et al.  Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.

[36]  Jing Yang,et al.  Weight Distribution of a Class of Cyclic Codes With Arbitrary Number of Zeros , 2013, IEEE Transactions on Information Theory.

[37]  Gennian Ge,et al.  The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs , 2012, IEEE Transactions on Information Theory.

[38]  T. Kasami.  WEIGHT DISTRIBUTION FORMULA FOR SOME CLASS OF CYCLIC CODES , 1966 .

[39]  Tor Helleseth,et al.  The weight hierarchy of the Kasami codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[40]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Laboratories Technical Journal.