A formalized optimum code search for q-ary trellis codes

This paper gives a formalization for q-ary codes of the search algorithm for optimum codes based on lattices and cosets. With a more efficient and an automated algorithm it has also been possible to extend the search for larger convolutional encoder parameters and lattice partitions. New optimum binary, ternary and quaternary trellis codes are listed together with their coding gains