An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

We present an upper bound on the minimum Euclidean distance d (E min) (C) f or block-coded PSK. The bound is an analytic expression depending on the alphabet size q, the b lock length n, and the number of codewords \ C \ of the code C. The bound i s valid for all block codes with q greater than or equal to 4 and with medi um or high rate-codes where \ C \ > (q/3)(n). There are several well-known block codes whose d (E min) (C) is equal to ou r upper bound. Hence these codes are the best possible in the sense that th ere does not exist a code with the same q, n, and \ C \ and with a larger d (E min) (C). It also follows that for many choices of q, n, and \ C \, in particular for high rates, our upper bound on d (E min) (C) is optimal.