DocumentCode :
932890
Title :
A lower bound for 
(Corresp.)
(Corresp.)Author :
Klove, Torleiv
Volume :
27
Issue :
2
fYear :
1981
fDate :
3/1/1981 12:00:00 AM
Firstpage :
257
Lastpage :
258
Abstract :
An explicit lower bound is given for , the maximum number of codewords in a binary code of length 
, minimum distance four, and constant weight 
.
, the maximum number of codewords in a binary code of length , minimum distance four, and constant weight .Keywords :
Error-correcting codes; Hamming weight; Information theory; Mathematics; Parity check codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1981.1056318
Filename :
1056318
Link To Document :
