A new lower bound for the parameters of (nonlinear)q-ary codes is introduced. For some q this bound improves on the Varshamov-Gilbert bound, the "modular" algebraic-geometric bound, and the very recent Vl\breve{a}duts bound.