By Topic

On the distance distribution of codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. Kalai ; Inst. of Math., Hebrew Univ., Jerusalem, Israel ; N. Linial

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

Published in:

IEEE Transactions on Information Theory  (Volume:41 ,  Issue: 5 )