{"title":"拉马努金球码","authors":"V. De Brunner, M. Allali","doi":"10.1109/ACSSC.2000.911057","DOIUrl":null,"url":null,"abstract":"A method for placing points (code vectors) on the unit sphere is presented. This method is based on a Ramanujan set of rotations, and generates an equidistributed system of points. An upper bound for Ramanujan spherical code is presented. This method is flexible and easy to implement as it needs only few transformations to cover the whole unit sphere with spherical caps.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"66 1","pages":"777-780 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Ramanujan spherical code\",\"authors\":\"V. De Brunner, M. Allali\",\"doi\":\"10.1109/ACSSC.2000.911057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for placing points (code vectors) on the unit sphere is presented. This method is based on a Ramanujan set of rotations, and generates an equidistributed system of points. An upper bound for Ramanujan spherical code is presented. This method is flexible and easy to implement as it needs only few transformations to cover the whole unit sphere with spherical caps.\",\"PeriodicalId\":10581,\"journal\":{\"name\":\"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)\",\"volume\":\"66 1\",\"pages\":\"777-780 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2000.911057\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2000.911057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A method for placing points (code vectors) on the unit sphere is presented. This method is based on a Ramanujan set of rotations, and generates an equidistributed system of points. An upper bound for Ramanujan spherical code is presented. This method is flexible and easy to implement as it needs only few transformations to cover the whole unit sphere with spherical caps.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
