DocumentCode
2801685
Title
Circulant graphs and spherical codes
Author
Costa, S.I.R. ; Strapasson, J.E. ; Siqueira, R.M. ; Muniz, M.
Author_Institution
State Univ. of Campinas, Campinas
fYear
2006
fDate
3-6 Sept. 2006
Firstpage
42
Lastpage
45
Abstract
Circulant graphs are homogeneous graphs with special properties which have been used to build interconnection networks for parallel computing. The association of circulant graphs to a spherical code in dimension 2k is presented here via the construction of an isomorphic graph supported by a lattice in Rk.
Keywords
codes; graph theory; circulant graphs; homogeneous graphs; isomorphic graph; spherical codes; Buildings; Computer networks; Concurrent computing; Lattices; Mathematics; Multiprocessor interconnection networks; Parallel processing; Circulant graphs; spherical codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications Symposium, 2006 International
Conference_Location
Fortaleza, Ceara
Print_ISBN
978-85-89748-04-9
Electronic_ISBN
978-85-89748-04-9
Type
conf
DOI
10.1109/ITS.2006.4433239
Filename
4433239
Link To Document