DocumentCode :
931147
Title :
Lower bounds for constant weight codes
Author :
Graham, R.L. ; Sloane, N. A J
Volume :
26
Issue :
1
fYear :
1980
fDate :
1/1/1980 12:00:00 AM
Firstpage :
37
Lastpage :
43
Abstract :
Let 
denote the maximum number of codewords in any binary code of length 
, constant weight 
, and Hamming distance 
Several lower bounds for are given. For and 
fixed, 
and 
as 
. In most cases these are better than the "Gilbert bound." Revised tables of 
are given in the range 
and 
.
denote the maximum number of codewords in any binary code of length , constant weight , and Hamming distance Several lower bounds for are given. For and fixed, and as . In most cases these are better than the "Gilbert bound." Revised tables of are given in the range and .Keywords :
Coding; Algebra; Entropy; Equations; Frequency; Hamming distance; Information geometry; Information theory; Mechanical variables measurement; Probability distribution; Quantum mechanics;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1980.1056141
Filename :
1056141
Link To Document :
