he Dimension of BCH Codes

We derive an upper bound on the number of information symbols of arbitrary $q$-ary BCH codes with a given constructive distance $d$ and length $n$. A similar result has been previously available only for codes of length $n=q^{m-1}$, $m=1,2,\dots$.