Rosa, E. M. [UNESP]Borelli, W. C.Farrell, P. G.2014-05-202014-05-201997-01-01Conference Record / IEEE Global Telecommunications Conference, v. 2, p. 948-952.http://hdl.handle.net/11449/132276This paper gives a formalization for q-ary codes of the search algorithm [3] for optimum codes based on lattices and cosets [1]. With a more efficient and an automated algorithm it also has been possible to extend the search for larger convolutional encoder parameters and lattices partitions. New optimum binary, ternary and quaternary trellis codes are listed together with their coding gains.948-952engAlgorithmsBinary codesConvolutional codesEncoding (symbols)Lattice partitionsQ ary codesTrellis codesTrabalho apresentado em evento10.1109/GLOCOM.1997.638466WOS:A1997BJ90L00178Acesso aberto2-s2.0-0031355719