DocumentCode :
917506
Title :
Long primitive binary BCH codes have distance 
Author :
Berlekamp, Elwyn R.
Volume :
18
Issue :
3
fYear :
1972
fDate :
5/1/1972 12:00:00 AM
Firstpage :
415
Lastpage :
426
Abstract :
In this paper, we obtain upper and lower bounds on the designed and actual distances of any sequence of extended primitive BCH codes of increasing lengths 
and fixed rate 
. The results of this paper are based on [1, ch. 12], which gives an exact expression for the rates of any sequence of extended primitive BCH codes of increasing length and fixed ratio of distance/length.
and fixed rate . The results of this paper are based on [1, ch. 12], which gives an exact expression for the rates of any sequence of extended primitive BCH codes of increasing length and fixed ratio of distance/length.Keywords :
BCH codes; Computer errors; Estimation theory; Mathematics; Telephony; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1972.1054818
Filename :
1054818
Link To Document :
