Skip to Main Content
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.
Telecommunications Symposium, 2006 International
Date of Conference: 3-6 Sept. 2006