Groups and noncommutative algebra: interactions and applications
Introduction to cyclic codes over commutative rings and algebraic integer numbers ...
Full text | |
Author(s): |
Monteiro de Siqueira, Rogerio
;
Rodrigues Costa, Sueli I.
;
IEEE
Total Authors: 3
|
Document type: | Journal article |
Source: | 2006 IEEE INFORMATION THEORY WORKSHOP; v. N/A, p. 2-pg., 2006-01-01. |
Abstract | |
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, rho) displayed on the sphere Sn-1, having a minimum squared distance rho. 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. (AU) | |
FAPESP's process: | 02/07473-7 - Geometrically uniform codes in homogeneous spaces |
Grantee: | Sueli Irene Rodrigues Costa |
Support Opportunities: | Research Projects - Thematic Grants |