{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:11:37Z","timestamp":1696637497425},"reference-count":23,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,7,1]]},"DOI":"10.1587\/transfun.2020eal2113","type":"journal-article","created":{"date-parts":[[2021,1,11]],"date-time":"2021-01-11T22:54:37Z","timestamp":1610405677000},"page":"979-983","source":"Crossref","is-referenced-by-count":2,"title":["Optimal and Asymptotically Optimal Codebooks as Regards the Levenshtein Bounds"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Hong-Li","family":"WANG","sequence":"first","affiliation":[{"name":"Department of Mathematics and Information Sciences, Tangshan Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Li","family":"FAN","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Information Sciences, Tangshan Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Tianjin Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin-Zhi","family":"SHEN","sequence":"additional","affiliation":[{"name":"School of Sciences, Civil Aviation University of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[2] D.J. Love, R.W. Heath, and T. Strohmer, \u201cGrassmannian beamforming for multiple input multiple output wireless systems,\u201d IEEE Trans. Inf. Theory, vol.49, no.10, pp.2735-2747, 2003. 10.1109\/tit.2003.817466","DOI":"10.1109\/TIT.2003.817466"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[3] 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":"3","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":"4","doi-asserted-by":"publisher","unstructured":"[6] J. Conway, R. Harding, and N. Sloane, \u201cPacking lines, planes, etc.: Packings in Grassmannian spaces,\u201d Exp. Math., vol.5, no.2, pp.139-159, 1996. 10.1080\/10586458.1996.10504585","DOI":"10.1080\/10586458.1996.10504585"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[7] S. Li and G. Ge, \u201cDeterministic sensing matrices arising from near orthogonal systems,\u201d IEEE Trans. Inf. Theory, vol.60, no.4, pp.2291-2302, 2014. 10.1109\/tit.2014.2303973","DOI":"10.1109\/TIT.2014.2303973"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[8] P. Delsarte, J. Goethals, and J. Seidel, \u201cSpherical codes and designs,\u201d Geom. Dedicata, vol.67, no.3, pp.363-388, 1997. 10.1007\/bf03187604","DOI":"10.1007\/BF03187604"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[10] P. Xia, S. Zhou, and G. 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":"8","doi-asserted-by":"publisher","unstructured":"[11] T. Strohmer and R. Heath, \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":"9","doi-asserted-by":"publisher","unstructured":"[12] 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":"10","doi-asserted-by":"publisher","unstructured":"[13] M. Fickus, D. Mixon, and J. 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":"11","doi-asserted-by":"publisher","unstructured":"[14] M. Fickus, D. 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":"12","doi-asserted-by":"publisher","unstructured":"[15] Z. Zhou and X. Tang, \u201cNew nearly optimal codebooks from relative difference sets,\u201d Adv. Math. Commun., vol.5, no.3, pp.521-527, 2011. 10.3934\/amc.2011.5.521","DOI":"10.3934\/amc.2011.5.521"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[16] C. Li, Q. Yue, and Y. Huang, \u201cTwo families of nearly optimal codebooks,\u201d Des. Codes Cryptogr., vol.75, no.1, pp.43-57, 2015. 10.1007\/s10623-013-9891-7","DOI":"10.1007\/s10623-013-9891-7"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[17] 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":"15","doi-asserted-by":"publisher","unstructured":"[18] G. Luo and X. Cao, \u201cTwo constructions of asymptotically optimal codebooks via the hyper Eisenstein sum,\u201d IEEE Trans. Inf. Theory, vol.64, no.10, pp.6498-6505, 2017. 10.1109\/tit.2017.2777492","DOI":"10.1109\/TIT.2017.2777492"},{"key":"16","unstructured":"[19] V.I. Levenshtein, \u201cBounds for packing of metric spaces and some of their applications,\u201d Problem Cybern., vol.40, pp.43-110, 1983."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[20] 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":"18","doi-asserted-by":"publisher","unstructured":"[21] C. Ding and J. Yin, \u201cSingal sets from functions with optimal 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":"19","doi-asserted-by":"publisher","unstructured":"[22] 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":"20","doi-asserted-by":"publisher","unstructured":"[23] T. Durt, B. Englert, I. Bengtsson, and K. Zyczkowski, \u201cOn Mutually unbiased bases,\u201d Int. J. Quantum. Inf., vol.8, no.4, pp.535-640, 2010. 10.1142\/s0219749910006502","DOI":"10.1142\/S0219749910006502"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[24] A. Klappenecker, M. R\u00f6tteler, I.E. Spharlinski, and A. Winterhof, \u201cOn approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states,\u201d J. Math. Phys. A, vol.46, no.8, 082104, 2005. 10.1063\/1.1998831","DOI":"10.1063\/1.1998831"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[25] A. Klappenecker and M. R\u00f6tteler, \u201cConstructions of mutually unbiased bases,\u201d Finite Fields and Applications Lecture Notes in Computer Science, vol.2948, pp.137-144, Springer-Verlag, Berlin, Germany, 2004. 10.1007\/978-3-540-24633-6_10","DOI":"10.1007\/978-3-540-24633-6_10"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[26] I.E. Shparlinski and A. Winterhof, \u201cConstructions of approximately mutually unbiased bases,\u201d LATIN 2006: Theoretical Informatics, Lecture Notes in Computer Science, vol.3887, pp.793-799, Springer-Verlag, Berlin, Germany, 2006. 10.1007\/11682462_72","DOI":"10.1007\/11682462_72"}],"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\/E104.A\/7\/E104.A_2020EAL2113\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T04:53:04Z","timestamp":1625287984000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/7\/E104.A_2020EAL2113\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,1]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eal2113","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,1]]},"article-number":"2020EAL2113"}}