DocumentCode
932391
Title
Binary codes with a minimum distance of four (Corresp.)
Author
Best, M.R.
Volume
26
Issue
6
fYear
1980
fDate
11/1/1980 12:00:00 AM
Firstpage
738
Lastpage
742
Abstract
A new binary code of length ten and minimum Hamming distance four is presented. It contains 40 words and is therefore optimal. It gives rise to a new sphere packing in ten dimensions. Furthermore, it is proved that a binary code of length 11 and minimum distance four cannot contain 80 words.
Keywords
Coding; Binary codes; Decoding; Error correction; Redundancy; Search methods;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1980.1056269
Filename
1056269
Link To Document