Bounds on the weight hierarchies of linear codes of dimension 4

被引：11
作者：
Chen, W
Klove, T
机构：
[1] ACAD SINICA,GRAD SCH,KEY STATE LAB INFORMAT SECUR,BEIJING 100080,PEOPLES R CHINA
[2] UNIV BERGEN,BERGEN HIGH TECHNOL CTR,DEPT INFORMAT,N-5020 BERGEN,NORWAY
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1997年 / 43卷 / 06期
基金：
中国国家自然科学基金;
关键词：
chain condition; difference sequence; q-ary code; support weight; weight hierarchy;
D O I：
10.1109/18.641575
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The weight hierarchy of a linear [n, k; q] code C over GP (q) 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. For each class bounds and extremal cedes are discussed.
引用
收藏
页码：2047 / 2054
页数：8
相关论文
共 16 条
[1]   WEIGHT HIERARCHY OF A PRODUCT CODE [J].
BARBERO, AI ;
TENA, JG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (05) :1475-1479
[2]  
BARBERO AI, 1996, IEEE T INFORM THEORY, V42, P2265
[3]  
BARBERO AI, IN PRESS J STAT PLAN
[4]  
BARBERO AI, 1996, 2 SHANGH C DES COD F, P15
[5]  
BARBERO AI, 1997, APPL ALGEBRA ENG COM, V8, P379
[6]   CODES SATISFYING THE CHAIN CONDITION [J].
ENCHEVA, S ;
KLOVE, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (01) :175-180
[7]   DIMENSION LENGTH PROFILES AND TRELLIS COMPLEXITY OF LINEAR BLOCK-CODES [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) :1741-1752
[8]   The weight hierarchies of some product codes [J].
Helleseth, T ;
Klove, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) :1029-1034
[9]   WEIGHT DISTRIBUTION OF IRREDUCIBLE CYCLIC CODES WITH BLOCK LENGTHS N1((Q1-1)-N) [J].
HELLESETH, T ;
KLOVE, T ;
MYKKELTVEIT, J .
DISCRETE MATHEMATICS, 1977, 18 (02) :179-211
[10]   GENERALIZED HAMMING WEIGHTS OF LINEAR CODES [J].
HELLESETH, T ;
KLOVE, T ;
YTREHUS, O .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :1133-1140
12