Discrete Geometry and Codes / Geometria discreta e codigos

AUTOR(ES)
DATA DE PUBLICAÇÃO

2007

RESUMO

The research developed here is related and inspired by problems in coding theory. It is presented in two parts. In the first we focus on the search for the minimum nonvanishing vector of a lattice, specially in the case of a projection of the ndimensional integer lattice in the direction of one of its vectors. This is a problem of high computational complexity which is related to the search for efficient joint sourcechannel continuous coding. In the second part we deal with flat torus graphs generated by a quotient of lattices and which are labeled by a a cyclic group of isometries. We show that any circulant graph is isomorphic to one of these graphs and hence associated to a spherical code. Through these isomorphism a complete classification of circulant graphs of genus one and the genus of an arbitrarily high order class of circulant graphs is obtained.

ASSUNTO(S)

teoria dos reticulados discrete geometry teoria da codificação teoria dos grafos codes theory graphs theory lattices geometria discreta

Documentos Relacionados