{"title":"接近韦尔奇界的密码本的新构造","authors":"Zexia Shi, Lei Sun, Fang-Wei Fu","doi":"10.1142/s012905412050032x","DOIUrl":null,"url":null,"abstract":"Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Constructions of Codebooks Nearly Meeting the Welch Bound\",\"authors\":\"Zexia Shi, Lei Sun, Fang-Wei Fu\",\"doi\":\"10.1142/s012905412050032x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is...\",\"PeriodicalId\":192109,\"journal\":{\"name\":\"Int. J. Found. Comput. Sci.\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Found. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s012905412050032x\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s012905412050032x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Constructions of Codebooks Nearly Meeting the Welch Bound
Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is...
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
