Linear codes from simplicial complexes

In this article we introduce a method of constructing binary linear codes and computing their weights by means of Boolean functions arising from mathematical objects called simplicial complexes. Inspired by Adamaszek (Am Math Mon 122:367–370, 2015) we introduce n-variable generating functions associated with simplicial complexes and derive explicit formulae. Applying the construction (Carlet in Finite Field Appl 13:121–135, 2007; Wadayama in Des Codes Cryptogr 23:23–33, 2001) of binary linear codes to Boolean functions arising from simplicial complexes, we obtain a class of optimal linear codes and a class of minimal linear codes.

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

[2]  Gérard D. Cohen,et al.  On Minimal and Quasi-minimal Linear Codes , 2013, IMACC.

[3]  Cunsheng Ding,et al.  Nonlinearities of S-boxes , 2007, Finite Fields Their Appl..

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

[5]  Cunsheng Ding,et al.  Covering and Secret Sharing with Linear Codes , 2003, DMTCS.

[6]  Alexander Barg,et al.  Minimal Vectors in Linear Codes , 1998, IEEE Trans. Inf. Theory.

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

[8]  Michal Adamaszek.  Face Numbers of Down-Sets , 2015, Am. Math. Mon..

[9]  Masao Kasahara,et al.  Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function , 2001, Des. Codes Cryptogr..

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

[11]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).