Finite Projective Geometries and Classification of the Weight Hierarchies of Codes(Ⅰ)

作     者：WenDeCHEN TorleivKLφVE 

作者机构：LaboratoryofSystemsandControlCenterofInformationSecurityAcademyofMathematicsandSystemsScienceChineseAcademyofSciencesBeijing100080P.R.China DepartmentoflnformaticsUniversityofBergenBergenHighTechnologyCenterN-5020BergenNorway 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2004年第20卷第2期

页      面：333-348页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：supported by The Norwegian Research Council the National Science Foundation of China(10271116) 

主　　题：Weight hierarchy Support weight Finite projective geometries Binary linear code Chain condition Difference sequence 

摘      要：The weight hierarchy of a binary linear [n, k] code C is the sequence (d 1, d 2, . . . , d k ), where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and the possible weight hierarchies in each class is determined by finite projective geometries. The possible weight hierarchies in class A, B, C, D are determined in Part (I). The possible weight hierarchies in class E, F, G, H, I are determined in Part (II).