Optimum Commutative Group Codes
  A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of non-isometric cases to be analyzed. The classical factorization of matrices into Hermite and Smith normal forms and also basis reduction of lattices are used to characterize isometric commutative group codes. Several examples of optimum commutative group codes are also presented. 
Cristiano Torezzan, Jo\~ao E. Strapasson, Sueli I. R. Costa and   Rogerio M. Siqueira
cs.IT math.GR math.IT