DocumentCode :
924777
Title :
Binary codes with improved minimum weights (Corresp.)
Author :
Alltop, William O.
Volume :
22
Issue :
2
fYear :
1976
fDate :
3/1/1976 12:00:00 AM
Firstpage :
241
Lastpage :
243
Abstract :
A recent table of Helgert and Stinaff gives bounds for 
, the maximum minimum distance over all binary linear 
error-correcting codes, 
. Twelve new codes are constructed which improve lower bounds in the table. Two methods are employed: the algebraic puncturing technique of Solomon and Stiffler and generation by combinatorial incidence matrices.
, the maximum minimum distance over all binary linear error-correcting codes, . Twelve new codes are constructed which improve lower bounds in the table. Two methods are employed: the algebraic puncturing technique of Solomon and Stiffler and generation by combinatorial incidence matrices.Keywords :
Error-correcting codes; Binary codes; Error correction codes; Lakes; Linear code; Shift registers; Upper bound; Vectors; Weapons;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1976.1055518
Filename :
1055518
Link To Document :
