Estimates of the distance distribution of codes and designs

被引:24
作者
Ashikhmin, A [1 ]
Barg, A
Litsyn, S
机构
[1] Lucent Technol, Bell Labs, Murray Hill, NJ 07974 USA
[2] Tel Aviv Univ, Dept Elect Engn Syst, IL-69978 Tel Aviv, Israel
关键词
binomial spectrum; constant weight codes; distance distribution; Krawtchouk polynomials; polynomial method;
D O I
10.1109/18.915662
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. Applying the polynomial method, we provide a general framework for previously known results. We derive several upper and lower bounds both for finite length and for sequences of codes of growing length. Asymptotic results in the paper improve previously known estimates. In particular, we prove the best known bounds on the binomiality range of the distance spectrum of codes with a known dual distance.
引用
收藏
页码:1050 / 1061
页数:12
相关论文
共 26 条
[1]  
[Anonymous], 1987, PROBL PEREDACHI INF
[2]   Binomial moments of the distance distribution: Bounds and applications [J].
Ashikhmin, A ;
Barg, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :438-452
[3]   Upper bounds on the size of quantum codes [J].
Ashikhmin, A ;
Litsyn, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (04) :1206-1215
[4]   New upper bounds on generalized weights [J].
Ashikhmin, A ;
Barg, A ;
Litsyn, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (04) :1258-1263
[5]  
ASHIKHMIN A, 2001, IN PRESS CODES ASS S
[7]  
DELSARTE P, 1973, PHILIPS RES REP, P1
[8]   ON THE DISTANCE DISTRIBUTION OF CODES [J].
KALAI, G ;
LINIAL, N .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (05) :1467-1472
[9]   AN APPROXIMATION TO THE WEIGHT DISTRIBUTION OF BINARY LINEAR CODES [J].
KASAMI, T ;
FUJIWARA, T ;
LIN, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) :769-780
[10]  
KATSMAN GL, 1992, LECT NOTES MATH, V1518, P82