{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T03:41:45Z","timestamp":1759549305274,"version":"build-2065373602"},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,10,1]]},"DOI":"10.1587\/transfun.2025eal2022","type":"journal-article","created":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T18:12:37Z","timestamp":1744827157000},"page":"1413-1417","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of Codebooks Based on Additive Characters"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Weixin","family":"LIU","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Tiangong University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaifang","family":"CHENG","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Tiangong University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuyan","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Tiangong University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"YAN","sequence":"additional","affiliation":[{"name":"Fujian Key Laboratory of Financial Information Processing, Putian University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanghao","family":"JIN","sequence":"additional","affiliation":[{"name":"Beijing Polytechnic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] X. Cao, W. Chou, and X. Zhang, \u201cMore constructions of near optimal codebooks associated with binary sequences,\u201d Adv. Math. Commun., vol.11, no.1, pp.187-202, 2017. 10.3934\/amc.2017012","DOI":"10.3934\/amc.2017012"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] J.H. Conway, R.H. Harding, and N.J.A. Sloane, \u201cPacking lines, planes, etc.: Packings in grassmannian spaces,\u201d Exp. Math., vol.5, no.2, 139-159, 1996.","DOI":"10.1080\/10586458.1996.10504585"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] C. Ding, \u201cComplex codebooks from combinatorial designs,\u201d IEEE Trans. Inf. Theory, vol.52, no.9, pp.4229-4235, 2006. 10.1109\/tit.2006.880058","DOI":"10.1109\/TIT.2006.880058"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] C. Ding and J. Yin, \u201cSignal sets from functions with optimum nonlinearity,\u201d IEEE Trans. Commun., vol.55, no.5, pp.936-940, 2007. 10.1109\/TCOMM.2007.894113","DOI":"10.1109\/TCOMM.2007.894113"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] C. Ding and T. Feng, \u201cA generic construction of complex codebooks meeting the Welch bound,\u201d IEEE Trans. Inf. Theory, vol.53, no.11, pp.4245-4250, 2007. 10.1109\/TIT.2007.907343","DOI":"10.1109\/TIT.2007.907343"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] M. Fickus, D.G. Mixon, and J. Jasper, \u201cEquiangular tight frames from hyperovals,\u201d IEEE Trans. Inf. Theory, vol.62, no.9, pp.5225-5236, 2016. 10.1109\/TIT.2016.2587865","DOI":"10.1109\/TIT.2016.2587865"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M. Fickus, D.G. Mixon, and J.C. Tremain, \u201cSteiner equiangular tight frames,\u201d Linear Algebra Appl., vol.436, no.5, pp.1014-1027, 2012. 10.1016\/j.laa.2011.06.027","DOI":"10.1016\/j.laa.2011.06.027"},{"key":"8","unstructured":"[8] M. Fickus and D. Mixon, \u201cTables of the existence of equiangular tight frames,\u201d arXiv:1504.00253v2, 2016. 10.48550\/arXiv.1504.00253"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] M. Fickus, J. Jasper, D. Mixon, and J. Peterson, \u201cTremain equiangular tight frames,\u201d arXiv:1602.03490v1, 2016. 10.48550\/arXiv.1602.03490","DOI":"10.1109\/SAMPTA.2015.7148910"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Han, S. Sun, Y. Yan, and Q. Wang, \u201cA new construction of codebooks meeting the Levenshtein bound,\u201d IEEE Access, vol.8, pp.77598-77603, 2020. 10.1109\/access.2020.2989360","DOI":"10.1109\/ACCESS.2020.2989360"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Z. Heng, C. Ding, and Q. Yue, \u201cNew constructions of asymptotically optimal codebooks with multiplicative characters,\u201d IEEE Trans. Inf. Theory, vol.63, no.10, pp.6179-6187, 2017. 10.1109\/tit.2017.2693204","DOI":"10.1109\/TIT.2017.2693204"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Z. Heng and Q. Yue, \u201cOptimal codebooks achieving the Levenshtein bound from generalized bent functions over \u2124<sub>4<\/sub>,\u201d Cryptogr. Commun. vol.9, no.1, pp.41-53, 2017. 10.1007\/s12095-016-0194-5","DOI":"10.1007\/s12095-016-0194-5"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Z. Heng, \u201cNearly optimal codebooks based on generalized Jacobi sums,\u201d Dis. Appl. Math., vol.25, no.11, pp.227-240, 2018. 10.1016\/j.dam.2018.05.017","DOI":"10.1016\/j.dam.2018.05.017"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] H. Hu and J. Wu, \u201cNew constructions of codebooks nearly meeting the Welch bound with equality,\u201d IEEE Trans. Inf. Theory, vol.60, no.2, pp.1348-1355, 2014. 10.1109\/tit.2013.2292745","DOI":"10.1109\/TIT.2013.2292745"},{"key":"15","unstructured":"[15] V.I. Levenshtein, \u201cBounds for packing of metric spaces and some of their applications,\u201d Probl. Cybern., vol.40, pp.43-110, 1983."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] P. Tan, Z. Zhou, and D. Zhang, \u201cA construction of codebooks nearly achieving the Levenshtein bound,\u201d IEEE Signal Process. Lett., vol.23, no.10, pp.1306-1309, 2016. 10.1109\/LSP.2016.2595106","DOI":"10.1109\/LSP.2016.2595106"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] G. Luo and X. Cao, \u201cTwo constructions of asymptotically optimal codebooks,\u201d Cryptogr. Commun., vol.11, no.4, pp.825-838, 2019. 10.1007\/s12095-018-0331-4","DOI":"10.1007\/s12095-018-0331-4"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[20] G. Luo and X. Cao, \u201cTwo constructions of asymptotically optimal codebooks via the hyper Eisenstein sum,\u201d IEEE Trans. Inf. Theory, vol.63, no.10, pp.6498-6505, Oct. 2018. 10.1109\/tit.2017.2777492","DOI":"10.1109\/TIT.2017.2777492"},{"key":"19","unstructured":"[21] F. Rahimi, \u201cCovering graphs and equiangular tight Frames,\u201d Ph.D. thesis, University of Waterloo, Ontario, 2016 (available at http:\/\/hdl.handle.net\/10012\/10793 )."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[22] D. Sarwate, \u201cMeeting the Welch bound with equality,\u201d Proc. SETA\u201998, pp.63-79, Springer-Verlag, Berlin, Heidelberg, 1999.","DOI":"10.1007\/978-1-4471-0551-0_6"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[23] T. Strohmer and R.W. Heath, Jr., \u201cGrassmannian frames with applications to coding and communication,\u201d Appl. Comput. Harmon. Anal., vol.14, no.3, pp.257-275, 2003. 10.1016\/S1063-5203(03)00023-X","DOI":"10.1016\/S1063-5203(03)00023-X"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[24] Q. Wang, X. Liang, R. Jin, and Y. Yan, \u201cApplications of strongly regular Cayley graphs to codebooks,\u201d IEEE Access, vol.11, pp.106980-106986, 2023. 10.1109\/ACCESS.2023.3320559","DOI":"10.1109\/ACCESS.2023.3320559"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[25] Q. Wang, W. Liu, J. Wang, and Y. Yan, \u201cA class of nearly optimal codebooks and their applications in strongly regular Cayley graphs,\u201d AIMS Mathematics, vol.9, no.7, pp.18236-18246, 2024. 10.3934\/math.2024890","DOI":"10.3934\/math.2024890"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[26] L. Welch, \u201cLower bounds on the maximum cross correlation of signals,\u201d IEEE Trans. Inf. Theory, vol.20, no.3, pp.397-399, 1974. 10.1109\/tit.1974.1055219","DOI":"10.1109\/TIT.1974.1055219"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[27] C. Xiang, C. Ding, and S. Mesnager, \u201cOptimal codebooks from binary codes meeting the Levenshtein bound,\u201d IEEE Trans. Inf. Theory, vol.61, no.12, pp.6526-6535, 2015. 10.1109\/TIT.2015.2487451","DOI":"10.1109\/TIT.2015.2487451"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[28] P. Xia, S. Zhou, and G.B. Giannakis, \u201cAchieving the Welch bound with difference sets,\u201d IEEE Trans. Inf. Theory, vol.51, no.5, pp.1900-1907, 2005. 10.1109\/tit.2005.846411","DOI":"10.1109\/TIT.2005.846411"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[29] Y. Yan, H. Chen, J. Wang, and G. Wang, \u201cA new construction of asymptotically optimal codebooks,\u201d AIMS Mathematics, vol.9, no.4, pp.9631-9640, 2024. 10.3934\/math.2024471","DOI":"10.3934\/math.2024471"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[30] Y. Yan, Y. Yao, Z. Chen, and Q. Wang, \u201cTwo new families of asymptotically optimal codebooks from characters of cyclic groups,\u201d IEICE Trans. Fundamentals, vol.E104-A, no.8, pp.1027-1032, Aug. 2021. 10.1587\/transfun.2020eap1124","DOI":"10.1587\/transfun.2020EAP1124"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[31] Y. Yan, X. Zhang, R. Jin, and L. Zhou, \u201cA construction of strongly regular Cayley graphs and their applications to codebooks,\u201d AIMS Mathematics, vol.9, no.2, pp.2672-2683, 2024. 10.3934\/math.2024132","DOI":"10.3934\/math.2024132"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[32] Z. Zhou, C. Ding, and N. Li, \u201cNew families of codebooks achieving the Levenstein bound,\u201d IEEE Trans. Inf. Theory, vol.60, no.11, pp.7382-7387, 2014. 10.1109\/tit.2014.2353052","DOI":"10.1109\/TIT.2014.2353052"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/10\/E108.A_2025EAL2022\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T03:29:53Z","timestamp":1759548593000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/10\/E108.A_2025EAL2022\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025eal2022","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"article-number":"2025EAL2022"}}