A LOWER-BOUND ON THE MINIMUM EUCLIDEAN DISTANCE OF TRELLIS-CODED MODULATION SCHEMES - COMMENTS

It is shown that the derivation in the subject paper is incorrect and hence the lower bound obtained is not valid for general trellis-coded modulation schemes. A corrected bound is presented to remedy this flaw. Also shown is a similar lower bound derived from the average distance structure. Both bounds have similar asymptotic behavior and are linear in the constraint length. Unfortunately, they are bad and not very useful for short and medium constraint lengths. This correspondence points out that there is still much room for further research in finding a good lower bound on the maximal minimum distance for trellis-coded modulation schemas.