DocumentCode
1552941
Title
A lower bound for ternary constant weight codes
Author
Svanström, Mattias
Author_Institution
Dept. of Electr. Eng., Linkoping Univ., Sweden
Volume
43
Issue
5
fYear
1997
fDate
9/1/1997 12:00:00 AM
Firstpage
1630
Lastpage
1632
Abstract
We derive a lower bound for ternary constant-weight codes with minimum Hamming distance three. The bound is similar to a bound for binary constant-weight codes with minimum distance four described by Graham and Sloane (1980). It improves upon the Gilbert (1952) bound and coincides asymptotically with the Johnson (1962) bound for fixed weight as the codeword length tends to infinity
Keywords
codes; minimisation; Gilbert bound; Johnson bound; codeword length; lower bound; minimum Hamming distance three; ternary constant weight codes; Binary codes; Computational modeling; Galois fields; H infinity control; Hamming distance; Hamming weight; Notice of Violation; Simulated annealing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.623164
Filename
623164
Link To Document