We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for their cardinality in terms of minimum distance and the maximum center density of lattices and general spherical packings in the half dimension of the code. This bound is tight in the sense it can be arbitrarily approached in any dimension. Examples of this approach and a comparison of this bound with Union and Rankin bounds for general spherical codes is also presented
ABSTRACT. We introduced with C. Bachoc and G. Nebe anotion of design (resp. code) in Grassmannian sp...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
AbstractWe use some basic results and ideas from the integral geometry to study certain properties o...
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly re...
Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices ca...
Abstract—A new class of spherical codes is constructed by selecting a finite subset of flat tori fro...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
Quotients of R2 by translation groups are metric spaces known as flat tori. We start from codes whic...
Orientador : Sueli Irene Rodrigues CostaTese (doutorado) - Universidade Estadual de Campinas, Instit...
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results...
Abstract. In this paper we discuss combinatorial questions about lattice polytopes motivated by rece...
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite p...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid ...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
ABSTRACT. We introduced with C. Bachoc and G. Nebe anotion of design (resp. code) in Grassmannian sp...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
AbstractWe use some basic results and ideas from the integral geometry to study certain properties o...
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly re...
Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices ca...
Abstract—A new class of spherical codes is constructed by selecting a finite subset of flat tori fro...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
Quotients of R2 by translation groups are metric spaces known as flat tori. We start from codes whic...
Orientador : Sueli Irene Rodrigues CostaTese (doutorado) - Universidade Estadual de Campinas, Instit...
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results...
Abstract. In this paper we discuss combinatorial questions about lattice polytopes motivated by rece...
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite p...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid ...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
ABSTRACT. We introduced with C. Bachoc and G. Nebe anotion of design (resp. code) in Grassmannian sp...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
AbstractWe use some basic results and ideas from the integral geometry to study certain properties o...