Classical results on error exponents for discrete memoryless channels focus on
determining the exponent itself; the bounds on the subexponential pre-factor are
quite loose. At rates close to capacity, however, the exponent is small so the
pre-factor plays a nonnegligible role. We discuss new upper and lower bounds on
the optimal pre-factor whose orders coincide for symmetric channels and nearly
coincide in general.