{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:54:35Z","timestamp":1713293675439},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"China Nation Natural Science Foundation","award":["61501395","61671402"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lsp.2019.2891896","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T19:37:25Z","timestamp":1547062645000},"page":"622-626","source":"Crossref","is-referenced-by-count":10,"title":["Constructions of Codebooks Asymptotically Achieving the Welch Bound With Additive Characters"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2990-0550","authenticated-orcid":false,"given":"Liying","family":"Tian","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0037-1528","authenticated-orcid":false,"given":"Yubo","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chengqian","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880058"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907343"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.06.027"},{"key":"ref13","first-page":"1014","article-title":"Tables of the existence of equiangular tight frames","volume":"436","author":"fickus","year":"2015","journal-title":"Mathematics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2587865"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2017.08.005"},{"key":"ref16","article-title":"Covering graphs and equiangular tight frames","author":"rahimi","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9891-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9753-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2176531"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.05.017"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1996.10504585"},{"key":"ref27","article-title":"Two constructions of asymptotically optimal codebooks","author":"luo","year":"2018","journal-title":"Cryptogr Commun"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9323-8_7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF03187604"},{"key":"ref29","volume":"20","author":"lidl","year":"1983","journal-title":"Finite Fields"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4916(89)90322-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0551-0_6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2303973"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846411"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1063-5203(03)00023-X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055219"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.3934\/amc.2011.5.521","article-title":"New nearly optimal codebooks from relative difference sets","volume":"5","author":"zhou","year":"2011","journal-title":"Adv Math Commun"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314298"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693204"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2292745"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437838"},{"key":"ref25","first-page":"6179","article-title":"Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum","volume":"63","author":"luo","year":"2017","journal-title":"IEEE Trans Inf Theory"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8648307\/08606203.pdf?arnumber=8606203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:56:22Z","timestamp":1657745782000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8606203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":29,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2019.2891896","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}