Long primitive binary BCH codes have distanced leq 2n ln R^{-1}/log n cdots
Elwyn R. Berlekamp · IEEE Transactions on Information Theory · 1972
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 lengthsnand fixed rateR. 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.