We consider block coded PSK, and improve a previously established upper bound on the minimum Euclidean distance d_E(C) that is valid for any block code C. The bound is an explicit function of the alphabet size, block length and the number of code words. The improvement involves choosing an inner metric to give the best possible bound for the outer metric, which is Euclidean. we describe this approach and its problems, and present empiric results.