渐近实现韦尔奇界的码本新构造

2018 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2018-06-17 DOI:10.1109/ISIT.2018.8437838

G. Luo, X. Cao

{"title":"渐近实现韦尔奇界的码本新构造","authors":"G. Luo, X. Cao","doi":"10.1109/ISIT.2018.8437838","DOIUrl":null,"url":null,"abstract":"In this paper, we propose two constructions of complex codebooks from character sums over Galois rings. The complex codebooks produced by these two constructions are proved to be asymptotically optimal with respect to the Welch bound. In addition, the parameters of the complex codebooks presented in this paper are new.","PeriodicalId":246565,"journal":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","volume":"81 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"New Constructions of Codebooks Asymptotically Achieving the Welch Bound\",\"authors\":\"G. Luo, X. Cao\",\"doi\":\"10.1109/ISIT.2018.8437838\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose two constructions of complex codebooks from character sums over Galois rings. The complex codebooks produced by these two constructions are proved to be asymptotically optimal with respect to the Welch bound. In addition, the parameters of the complex codebooks presented in this paper are new.\",\"PeriodicalId\":246565,\"journal\":{\"name\":\"2018 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"81 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2018.8437838\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2018.8437838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

本文从伽罗瓦环上的字符和出发，提出了两种复杂码本的构造。证明了这两种构造所产生的复码本对于Welch界是渐近最优的。此外，本文提出的复杂码本参数都是新的。

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

查看原文本刊更多论文

New Constructions of Codebooks Asymptotically Achieving the Welch Bound

In this paper, we propose two constructions of complex codebooks from character sums over Galois rings. The complex codebooks produced by these two constructions are proved to be asymptotically optimal with respect to the Welch bound. In addition, the parameters of the complex codebooks presented in this paper are new.

求助全文

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

来源期刊

2018 IEEE International Symposium on Information Theory (ISIT)

自引率

0.00%

发文量