Higher weights of affine Grassmann codes and their duals

被引:1
作者
Datta, Mrinmoy [1 ]
Ghorpade, Sudhir R. [1 ]
机构
[1] Indian Inst Technol, Dept Math, Bombay 400076, Maharashtra, India
来源
ALGORITHMIC ARITHMETIC, GEOMETRY, AND CODING THEORY | 2015年 / 637卷
关键词
REED-MULLER CODES; GENERALIZED HAMMING WEIGHTS; RELATIVES;
D O I
10.1090/conm/637/12750
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We consider the question of determining the higher weights or the generalized Hamming weights of affine Grossmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are determined explicitly. In the case of duals of these codes, we give a formula for many initial as well as terminal higher weights. As a special case, we obtain an alternative simpler proof of the formula of Beelen et al. for the minimum distance of the dual of an affine Grasmann code.
引用
收藏
页码:79 / 91
页数:13
相关论文
共 20 条
[1]   Duals of Affine Grassmann Codes and Their Relatives [J].
Beelen, Peter ;
Ghorpade, Sudhir R. ;
Hoholdt, Tom .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) :3843-3855
[2]   Affine Grassmann Codes [J].
Beelen, Peter ;
Ghorpade, Sudhir R. ;
Hoholdt, Tom .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (07) :3166-3176
[3]  
Boguslavsky M., 1997, Finite Fields and their Applications, V3, P287, DOI 10.1006/ffta.1997.0186
[4]   ON GENERALIZED REED-MULLER CODES AND THEIR RELATIVES [J].
DELSARTE, P ;
GOETHALS, JM ;
MACWILLI.FJ .
INFORMATION AND CONTROL, 1970, 16 (05) :403-&
[5]   Automorphism groups of Grassmann codes [J].
Ghorpade, Sudhir R. ;
Kaipa, Krishna V. .
FINITE FIELDS AND THEIR APPLICATIONS, 2013, 23 :80-102
[6]   Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes [J].
Ghorpade, Sudhir R. ;
Patil, Arunkumar R. ;
Pillai, Harish K. .
FINITE FIELDS AND THEIR APPLICATIONS, 2009, 15 (01) :54-68
[7]  
Ghorpade Sudhir R., 2000, CODING THEORY CRYPTO, P122
[8]  
Hansen Johan P., 2010, SEMIN C, V21, P103
[9]   Generalized hamming weights of q-ary Reed-Muller codes [J].
Heijnen, P ;
Pellikaan, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :181-196
[10]   NEW GENERALIZATIONS OF REED-MULLER CODES .I. PRIMITIVE CODES [J].
KASAMI, T ;
LIN, S ;
PETERSON, WW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (02) :189-+