MINIMUM SUPPORT WEIGHTS OF BINARY-CODES

被引：23
作者：
KLOVE, T
机构：
[1] Department of Informatics, University of Bergen, Høgteknologisenteret, N-5020, Berger
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 02期
关键词：
LINEAR CODES; HAMMING WEIGHT; SUPPORT WEIGHT; WEIGHT HIERARCHY;
D O I：
10.1109/18.212298
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The minimum support weight, d(r) (C), of a binary linear code C is the size of the smallest support of any r-dimensional subcode of C. The weight hierarchy of C is the set { d(r) (C) \ 1 less-than-or-equal-to r less-than-or-equal-to k }. Some relations between the minimum support weights are discussed. In particular, the possible weight hierarchies of codes of dimension 4 are determined.
引用
收藏
页码：648 / 654
页数：7
相关论文
共 10 条
[1]   ON THE GENERALIZED HAMMING WEIGHTS OF SEVERAL CLASSES OF CYCLIC CODES [J].
FENG, GL ;
TZENG, KK ;
WEI, VK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :1125-1130
[2]   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
[3]   GENERALIZED HAMMING WEIGHTS OF LINEAR CODES [J].
HELLESETH, T ;
KLOVE, T ;
YTREHUS, O .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :1133-1140
[4]  
KASAMI T, 1991, 4TH P INT C COD THEO, P49
[5]   WEIGHT DISTRIBUTION OF LINEAR CODES OVER GF(Q1) HAVING GENERATOR MATRIX OVER GF(Q) [J].
KLOVE, T .
DISCRETE MATHEMATICS, 1978, 23 (02) :159-168
[6]   OPTIMAL CODES FOR ERROR-DETECTION [J].
KLOVE, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (02) :479-489
[7]  
KLOVE T, 1992, DISCRETE MATH, V107, P311
[8]   WIRE-TAP CHANNEL .2. [J].
OZAROW, LH ;
WYNER, AD .
AT&T BELL LABORATORIES TECHNICAL JOURNAL, 1984, 63 (10) :2135-2157
[9]   AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES [J].
VERHOEFF, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (05) :665-680
[10]   GENERALIZED HAMMING WEIGHTS FOR LINEAR CODES [J].
WEI, VK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (05) :1412-1418
1