{"title":"循环图和球码","authors":"S. Costa, J. Strapasson, R. M. Siqueira, M. Muniz","doi":"10.1109/ITS.2006.4433239","DOIUrl":null,"url":null,"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.","PeriodicalId":271294,"journal":{"name":"2006 International Telecommunications Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Circulant graphs and spherical codes\",\"authors\":\"S. Costa, J. Strapasson, R. M. Siqueira, M. Muniz\",\"doi\":\"10.1109/ITS.2006.4433239\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":271294,\"journal\":{\"name\":\"2006 International Telecommunications Symposium\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.2006.4433239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.2006.4433239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
