On the Intersection of Binary Linear Codes  

作　　者：LIAO Dajian LIU Zihui 

机构地区：[1]College of Science,Huaihai Institute of Technology [2]Department of Mathematics,Beijing Institute of Technology

出　　处：《Journal of Systems Science & Complexity》2016年第3期814-824,共11页系统科学与复杂性学报（英文版）

基　　金：supported by the National Science Foundation of China under Grant Nos.11171366 and 61170257

摘　　要：For a binary linear code,a new relation between the intersection and(2,2)-separating property is addressed,and a relation between the intersection and the trellis complexity is also given.Using above relations,the authors will apply several classes of binary codes to secret sharing scheme and determine their trellis complexity and separating properties.The authors also present the properties of the intersection of certain kinds of two-weight binary codes.By using the concept of value function,the intersecting properties of general binary codes are described.

关 键 词：Minimal access structure minimal codeword separating property trellis complexity two- weight code value function. 

分 类 号：O157.4[理学—数学]