The algorithm given by Rouanne and Costello (1989) for the computation of the distance spectrum is improved for trellis-coded modulation schemes having uncoded bits, i.e., for trellis diagrams having parallel paths. It is shown that, when through a trellis corresponding to such kind of codes, all parallel transitions (labeled by signal selectors) between states are considered as a single branch labeled by a subset, then defining subset selector distance polynomials makes the computational complexity of the distance spectrum dependent on the number of states as compared to the complexity of Rouanne and Costello algorithm which depends on the number of paths to be extended.