Recently, a trellis-based recursive maximum likelihood decoding (RMLD) algorithm has been proposed for decoding binary linear block codes. This RMLD algorithm is computationally more efficient than the Viterbi decoding algorithm. However, the computational complexity of the RMLD algorithm depends on the sectionalization of a code trellis. In general, minimization of the computational complexity results in non-uniform sectionalization of a code trellis. From implementation point of view, uniform sectionalization of a code trellis and regularity among the trellis sections are desirable. In this paper, we apply the RMLD algorithm to a class of codes which are transitive invariant. This class includes Reed-Muller (RM) codes, the extended and permuted BCH (EBCH) codes and their subcodes. For this class of codes, the binary uniform sectionalization of a code trellis results in the following regular structure. At each step of decoding recursion, the metric table construction procedure is applied uniformly to all the sections and the size and structure of each metric table are the same. This simplifies the implementation of the RMLD algorithm. Furthermore, for all RM codes of lengths 64 and 128 and EBCH codes of lengths 64 and 128 with relatively low rate, the computational complexity of the RMLD algorithm based on the binary uniform sectionalization of a code trellis is almost the same as that based on an optimum sectionalization of a code trellis.