ON THE DISTANCE DISTRIBUTION OF CODES

被引：38

作者：

KALAI, G ^{[1
]}

LINIAL, N ^{[1
]}

机构：

[1] HEBREW UNIV JERUSALEM,INST COMP SCI,IL-91904 JERUSALEM,ISRAEL

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1995年 / 41卷 / 05期

关键词：

BINARY CODES; DISTANCE DISTRIBUTION; LINEAR PROGRAMMING BOUNDS;

D O I：

10.1109/18.412711

中图分类号：

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

学科分类号：

0812 ;

摘要：

The distance distribution of a binary code C is the sequence (B-i)(i)(n)=0 defined as follows: Let B-i(w) be the number of codewords at distance i from the codeword w, and let B-i be the average of B-i(w) over all w in C. In this correspondence we study the distance distribution for codes of length n and minimal distance delta n, with delta > 0 fixed and n --> infinity. Our main aim is to relate the size of the code with the distribution of distances near the minimal distance.

引用

页码：1467 / 1472

页数：6