An improvement of the Feng–Rao bound on minimum distance

We present a lower bound for the minimum distance of certain affine variety codes which is better than the Feng–Rao bound. We also introduce a minimum distance estimate which, at times, can serve as a lower bound as well.