{"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}
引用次数: 12
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
