Weight of duals of BCH codes and exponential sums

We consider a binary BCH code Cm of length 2m–1. If m is odd, we improve the bound on the distance of the dual of Cm previously given by Carlitz–Uchiyama, Serre and Moreno–Moreno.