{"title":"交换群码的上界","authors":"R. M. Siqueira, S. Costa","doi":"10.1109/ITW.2006.1633828","DOIUrl":null,"url":null,"abstract":"Good spherical codes have large minimum squared distance. An important quota in the theory of spherical codes is the maximum number of points M(n, rho) displayed on the sphere Sn-1, having a minimum squared distance rho. The aim of this work is to study this problem within the class of group codes. We establish a bound for the number of points of a commutative group code in dimension even.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Upper bounds for a Commutative Group Code\",\"authors\":\"R. M. Siqueira, S. Costa\",\"doi\":\"10.1109/ITW.2006.1633828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Good spherical codes have large minimum squared distance. An important quota in the theory of spherical codes is the maximum number of points M(n, rho) displayed on the sphere Sn-1, having a minimum squared distance rho. The aim of this work is to study this problem within the class of group codes. We establish a bound for the number of points of a commutative group code in dimension even.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633828\",\"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 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Good spherical codes have large minimum squared distance. An important quota in the theory of spherical codes is the maximum number of points M(n, rho) displayed on the sphere Sn-1, having a minimum squared distance rho. The aim of this work is to study this problem within the class of group codes. We establish a bound for the number of points of a commutative group code in dimension even.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
