New upper bounds on generalized weights

被引：19

作者：

Ashikhmin, A

Barg, A

Litsyn, S

机构：

[1] Los Alamos Natl Lab, Los Alamos, NM 87545 USA

[2] AT&T Bell Labs, Lucent Technol, Murray Hill, NJ 07974 USA

[3] Tel Aviv Univ, Dept Elect Engn Syst, IL-69978 Tel Aviv, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1999年 / 45卷 / 04期

关键词：

constant-weight codes; distance distribution; generalized weights; linear programming;

D O I：

10.1109/18.761280

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes.

引用

页码：1258 / 1263

页数：6

共 18 条

[1] Binomial moments of the distance distribution: Bounds and applications
Ashikhmin, A
Barg, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) : 438 - 452
[2] On Generalized Hamming Weights for Galois Ring Linear Codes
Ashikhmin A.
[J]. Designs, Codes and Cryptography, 1998, 14 (2) : 107 - 126
[3] The matroid of supports of a linear code
Barg, A
[J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1997, 8 (02) : 165 - 172
[4] Bassalygo LA, 1995, LECT NOTES COMPUT SC, V948, P1
[5] COHEN G, 1994, LECT NOTES COMPUTER, V781, P270
[6] INTERSECTING CODES AND INDEPENDENT FAMILIES
COHEN, GD
ZEMOR, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) : 1872 - 1881
[7] WEIGHT DISTRIBUTION OF IRREDUCIBLE CYCLIC CODES WITH BLOCK LENGTHS N1((Q1-1)-N)
HELLESETH, T
KLOVE, T
MYKKELTVEIT, J
[J]. DISCRETE MATHEMATICS, 1977, 18 (02) : 179 - 211
[8] BOUNDS ON THE MINIMUM SUPPORT WEIGHTS
HELLESETH, T
KLOVE, T
LEVENSHTEIN, VI
YTREHUS, O
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (02) : 432 - 440
[9] KABATIANSKY G, 1992, P INT WORKSHOP ALGEB, P98
[10] WEIGHT DISTRIBUTION OF LINEAR CODES OVER GF(Q1) HAVING GENERATOR MATRIX OVER GF(Q)
KLOVE, T
[J]. DISCRETE MATHEMATICS, 1978, 23 (02) : 159 - 168

← 1 2 →