UPPER-BOUNDS ON GENERALIZED DISTANCES

被引：28

作者：

COHEN, G ^{[1
]}

LITSYN, S ^{[1
]}

ZEMOR, G ^{[1
]}

机构：

[1] TEL AVIV UNIV,DEPT ELECT ENGN,IL-69978 TEL AVIV,ISRAEL

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1994年 / 40卷 / 06期

关键词：

GENERALIZED WEIGHT; ASYMPTOTIC BOUND;

D O I：

10.1109/18.340487

中图分类号：

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

学科分类号：

0812 ;

摘要：

We derive new asymptotic bounds for generalized distances. Our approach extends the classical Hamming, Plotkin, and Elias bounds. The latter bound involves extending the definition of generalized distances to nonlinear codes.

引用

页码：2090 / 2092

页数：3

共 10 条

[1]

Bassalygo L. A., 1965, PROBLEMY PEREDA I IN, V1, P41

[2] 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

[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]

KABATIANSKY G, 1992, P INT WORKSHOP ALGEB, P98

[5] ON THE OPTIMUM BIT ORDERS WITH RESPECT TO THE STATE COMPLEXITY OF TRELLIS DIAGRAMS FOR BINARY LINEAR CODES [J].

KASAMI, T ;

TAKATA, T ;

FUJIWARA, T ;

LIN, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) :242-245

[6]

Macwilliams F. J., 1977, THEORY ERROR CORRECT

[7] WIRE-TAP CHANNEL .2. [J].

OZAROW, LH ;

WYNER, AD .

AT&T BELL LABORATORIES TECHNICAL JOURNAL, 1984, 63 (10) :2135-2157

[8] CODE CONSTRUCTION FOR THE NOISELESS BINARY SWITCHING MULTIPLE-ACCESS CHANNEL [J].

VANROOSE, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1100-1106

[9] GENERALIZED HAMMING WEIGHTS FOR LINEAR CODES [J].

WEI, VK .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (05) :1412-1418

[10]

WEI VK, 1993, ORAL PRESENTATION AG

← 1 →