交换群码的上界

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI:10.1109/ITW.2006.1633828

R. M. Siqueira, S. Costa

{"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}

引用次数: 1

摘要

好的球形代码具有较大的最小平方距离。球码理论中的一个重要指标是在球Sn-1上显示的点的最大数目M(n, rho)具有最小平方距离rho。本文的目的是在群码的范畴内研究这一问题。建立了偶维交换群码的点个数的界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Upper bounds for a Commutative Group Code

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este

自引率

0.00%

发文量

期刊最新文献

Backward Channels in Multiterminal Source Coding Regret Minimization Under Partial Monitoring Scaling Law of the Sum-Rate for Multi-Antenna Broadcast Channels with Deterministic or Selective Binary Feedback Non-coherent Mutual Information of the Multipath Rayleigh Fading Channel in the Low SNR Regime Successive Refinement for Pattern Recognition