On the duals of binary BCH codes
José Felipe Voloch · IEEE Transactions on Information Theory · 2001
We give bounds for the minimal distance of duals of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.