Long primitive binary BCH codes have distanced leq 2n ln R^{-1}/log n cdots

1 May 1972

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 18 (3) , 415-426
https://doi.org/10.1109/tit.1972.1054818

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 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.

Keywords

This publication has 4 references indexed in Scilit:

The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
Information and Control, 1970
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
IEEE Transactions on Information Theory, 1969
On the number of information symbols in Bose-Chaudhuri codes
Information and Control, 1962
A Remark on Stirling's Formula
The American Mathematical Monthly, 1955