Title :
On the distance distribution of codes
Author :
Kalai, Gil ; Linial, Nathan
Author_Institution :
Inst. of Math., Hebrew Univ., Jerusalem, Israel
fDate :
9/1/1995 12:00:00 AM
Abstract :
The distinct distribution of a binary code C is the sequence (B i)i=0n defined as follows: let Bi (w) be the number of codewords at distance i from the codeword w, and let Bi be the average of Bi(w) over all w in C. In this correspondence we study the distance distribution for codes of length n and minimal distance δn, with δ>0 fixed and n→∞. Our main aim is to relate the size of the code with the distribution of distances near the minimal distance
Keywords :
codes; linear programming; polynomials; binary codes; codewords; distance distribution; linear programming bound; Binary codes; Entropy; Gas insulated transmission lines; H infinity control; Hamming distance; Linear programming; Mathematics; Notice of Violation; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
