By Topic

Circulant graphs and spherical codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Costa, S.I.R. ; State Univ. of Campinas, Campinas ; Strapasson, J.E. ; Siqueira, R.M. ; Muniz, M.

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.

Published in:

Telecommunications Symposium, 2006 International

Date of Conference:

3-6 Sept. 2006