Good spherical codes have large minimum squared distance. An important quota in the theory of spherical codes is the maximum number of points M(n,ρ) displayed on the sphere Sn-1, having a minimum squared distance ρ. The aim of this work is to study this problem within the class of group codes. We establish a bound for the number of points of a commutative group code in dimension even. © 2006 IEEE. 275277Ericson, T., Zinoviev, V., (2001) Codes on Euclidian Spheres, , North-Holland Mathematical Libray, Elsevier Science Pub CoBöröczky, K., Packing of spheres in spaces of constant curvature (1978) Acta Mathematica Academia Scientiarum Hungariacae, 32, pp. 243-261Costa, S.I.R., Vaishampayan, V., Curves on a sphere, shift-map dynamics, and error control for continuos alphabet sources (2003) IEEE Transaction on Information Theory, 49 (7). , JulyCosta, S.I.R., Muniz, M., Agustini, E., Palazzo, R., Graphs, tessellations, and perfect codes on flat tori (2004) IEEE Transaction on Information Theory, 50 (10). , OctoberCoxeter, H.S.M., An upper bound for the number of equal nonoverlapping spheres that can touch another of the same size (1963) Proc. Symp. in Pure Mathematics, 7, pp. 53-72Coxeter, H.S.M., (1999) The Beauty of Geometry - Twelve Essays, , Reprinted in, Dover Publications, INCIngermasson, I., Commutative group codes for the Gaussian channel (1973) IEEE Transaction on Information Theory, IT-19, pp. 215-219. , MarSlepian, D., Group codes for the Gaussian channel (1968) The Bell System Technical Journal, 4 (7), pp. 575-602. , AprilToth, L.F., Über die abschatzung des kürzesten abstandes zweier punkte eines auf einer kugelfläche liegenden punktsystemes (1943) Jber. Deut. Math Verein, 53, pp. 66-68Sloane, N.J.A., Conway, J.H., (1991) Sphere Packings, Lattices and Groups, , Springer-Verlag 3 edt