ON THE SECOND GREEDY WEIGHT FOR LINEAR CODES SATISFYING THE FULLRANK CONDITION  

作　　者：CHENWende KLOVETorleiv 

机构地区：[1]LaboratoryofSystemsandControlandCenterofInformationSecurity,AcademyofMathematicsandSystemsScience,ChineseAcademyofSciences,Beijing100080,China [2]DepartmentofInforrnatics,UniversityofBergen,BergenHighTechnologyCenter,N-5020Bergen,Norway

出　　处：《Journal of Systems Science & Complexity》2005年第1期55-66,共12页系统科学与复杂性学报（英文版）

基　　金：This paper was presented at International Congress of Mathematicians,August 20-28,2002,BeijingThis work was supported by the Norwegian Research Council and the National NaturalScience Foundation of China(GrantNo.10271116).

摘　　要：The maximum of g2-d2 for linear [n, k, d; q] codes C is studied. Here d2 is the smallest size of the support of 2-dimensional subcodes of C and g2 is the smallest size of the support of 2-dimensional subcodes of C which contains a codeword of weight d. The extra cost to the greedy adversary to get two symbols of information using some algorithm is g2-d2. For codes satisfying the fullrank condition of general dimensions, upper bounds on the maximum of g2-d2 are given. Under some condition we have got code C where g2-d2 reaches the upper bound.

关 键 词：greedy weight linear code BOUNDS 

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