Advanced search
Start date
Betweenand


Upper Bounds for Commutative Group Codes: the odd case

Author(s):
de Siqueira, Rogerio Monteiro ; Rodrigues Costa, Sueli I. ; IEEE
Total Authors: 3
Document type: Journal article
Source: PROCEEDINGS OF THE IEEE INTERNATIONAL TELECOMMUNICATIONS SYMPOSIUM, VOLS 1 AND 2; v. N/A, p. 2-pg., 2006-01-01.
Abstract

Good spherical codes must 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 restricted to the class of group codes. We establish a tighter bound for the number of points of a commutative group code in odd dimension, extending the bounds of [6]. (AU)

FAPESP's process: 02/07473-7 - Geometrically uniform codes in homogeneous spaces
Grantee:Sueli Irene Rodrigues Costa
Support Opportunities: Research Projects - Thematic Grants