Constructing a better cyclic code than cyclic Reed-Solomon code

Problems of computing the generator polynomial for a (q+1, q-d+2) reversible cyclic BCH code over GF(q), q=p/sup m/, having the minimum Hamming distance d, are presented. The considered code is almost as short as a Reed-Solomon (RS) code but it generates codewords with two information symbols more than the codewords of RS code with the same minimum Hamming distance.