DocumentCode :
938396
Title :
On the minimum distance of some quadratic residue codes (Corresp.)
Author :
Coppersmith, Don ; Seroussi, Gadiel
Volume :
30
Issue :
2
fYear :
1984
fDate :
3/1/1984 12:00:00 AM
Firstpage :
407
Lastpage :
411
Abstract :
We find the minimum distances of the binary 
, and ternary 
, and 
quadratic residue codes and the corresponding extended codes. These distances are 
, and 
, respectively, for the nonextended codes and are increased by one for the respective extended codes. We also characterize the minimum weight codewords for the binary code and its extended counterpart.
, and ternary , and quadratic residue codes and the corresponding extended codes. These distances are , and , respectively, for the nonextended codes and are increased by one for the respective extended codes. We also characterize the minimum weight codewords for the binary code and its extended counterpart.Keywords :
Residue coding; Artificial intelligence; Binary codes; Computer science; Laboratories; Propulsion; Quadratic programming;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056861
Filename :
1056861
Link To Document :
