DocumentCode :
919485
Title :
Minimum-distance bounds for binary linear codes
Author :
Helgert, Hermann J. ; Stinaff, Russell D.
Volume :
19
Issue :
3
fYear :
1973
fDate :
5/1/1973 12:00:00 AM
Firstpage :
344
Lastpage :
356
Abstract :
This paper presents a table of upper and lower bounds on 
, the maximum minimum distance over all binary, linear 
error-correcting codes. The table is obtained by combining the best of the existing bounds on with the minimum distances of known codes and a variety of code-construction techniques.
, the maximum minimum distance over all binary, linear error-correcting codes. The table is obtained by combining the best of the existing bounds on with the minimum distances of known codes and a variety of code-construction techniques.Keywords :
Error-correcting codes; Linear codes; Error correction; Error correction codes; Linear code; Parity check codes; Vectors;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1973.1055009
Filename :
1055009
Link To Document :
