{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:35:58Z","timestamp":1761744958648},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00200-019-00387-x","type":"journal-article","created":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T15:00:46Z","timestamp":1559055646000},"page":"453-469","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A further construction of asymptotically optimal codebooks with multiplicative characters"],"prefix":"10.1007","volume":"30","author":[{"given":"Wenjuan","family":"Yin","sequence":"first","affiliation":[]},{"given":"Can","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,28]]},"reference":[{"key":"387_CR1","volume-title":"An Introduction to Frames and Riesz Bases. Applied and Numerical Harmonic Analysis","author":"O Christensen","year":"2003","unstructured":"Christensen, O.: An Introduction to Frames and Riesz Bases. Applied and Numerical Harmonic Analysis. Birkh\u00e4user, Boston (2003)"},{"issue":"2","key":"387_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/10586458.1996.10504585","volume":"5","author":"JH Conway","year":"1996","unstructured":"Conway, J.H., Hardin, R.H., Sloane, N.J.A.: Packing lines, planes, etc.: Packings in grassmannian spaces. Exp. Math. 5(2), 139\u2013159 (1996)","journal-title":"Exp. Math."},{"issue":"2","key":"387_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1112\/S0024611597000403","volume":"75","author":"AR Calderbank","year":"1997","unstructured":"Calderbank, A.R., Cameron, P.J., Kantor, W.M., Seidel, J.J.: $$Z_4$$-Kerdock codes, orthogonal spreads, and extremal Euclidean linesets. Proc. Lond. Math. Soc. 75(2), 436\u2013480 (1997)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"5","key":"387_CR4","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1109\/TCOMM.2007.894113","volume":"55","author":"C Ding","year":"2007","unstructured":"Ding, C., Yin, J.: Signal sets from functions with optimum nonlinearity. IEEE Trans. Commun. 55(5), 936\u2013940 (2007)","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"387_CR5","doi-asserted-by":"publisher","first-page":"4229","DOI":"10.1109\/TIT.2006.880058","volume":"52","author":"C Ding","year":"2006","unstructured":"Ding, C.: Complex codebooks from combinatorial designs. IEEE Trans. Inf. Theory 52(9), 4229\u20134235 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"387_CR6","doi-asserted-by":"publisher","first-page":"4245","DOI":"10.1109\/TIT.2007.907343","volume":"53","author":"C Ding","year":"2007","unstructured":"Ding, C., Feng, T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inf. Theory 53(11), 4245\u20134250 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"387_CR7","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.laa.2011.06.027","volume":"436","author":"M Fickus","year":"2012","unstructured":"Fickus, M., Mixon, D.G., Tremain, J.C.: Steiner equiangular tight frames. Linear Algebra Appl. 436(5), 1014\u20131027 (2012)","journal-title":"Linear Algebra Appl."},{"key":"387_CR8","unstructured":"Fickus, M., Mixon, D.G.: Tables of the existence of equiangular tight frames. \n                    arXiv:1504.00253"},{"issue":"9","key":"387_CR9","doi-asserted-by":"publisher","first-page":"5225","DOI":"10.1109\/TIT.2016.2587865","volume":"62","author":"M Fickus","year":"2016","unstructured":"Fickus, M., Mixon, D.G., Jasper, J.: Equiangular tight frames from hyperovals. IEEE Trans. Inf. Theory 62(9), 5225\u20135236 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"387_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jcta.2017.08.005","volume":"153","author":"M Fickus","year":"2018","unstructured":"Fickus, M., Jasper, J., Mixon, D., Peterson, J.: Tremain equiangular tight frames. Comb. Theory Ser. A 153, 54\u201366 (2018)","journal-title":"Comb. Theory Ser. A"},{"key":"387_CR11","volume-title":"Sequences II","author":"JL Massey","year":"1993","unstructured":"Massey, J.L., Mittelholzer, T.: Welch\u2019s Bound and Sequence Sets for Code-Division Multiple-Access Systems. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds.) Sequences II. Springer, New York, NY (1993)"},{"key":"387_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.dam.2018.05.017","volume":"250","author":"Z Heng","year":"2018","unstructured":"Heng, Z.: Nearly optimal codebooks based on generalized Jacobi sums. Discrete Appl. Math. 250, 227\u2013240 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"387_CR13","doi-asserted-by":"publisher","first-page":"6179","DOI":"10.1109\/TIT.2017.2693204","volume":"63","author":"Z Heng","year":"2017","unstructured":"Heng, Z., Ding, C., Yue, Q.: New constructions of asymptotically optimal codebooks with multiplicative characters. IEEE Trans. Inf. Theory 63(10), 6179\u20136187 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"387_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12095-016-0194-5","volume":"9","author":"Z Heng","year":"2017","unstructured":"Heng, Z., Yue, Q.: Optimal codebooks achieving the Levenshtein bound from generalized bent functions over $$Z_4$$. Cryptogr. Commun. 9(1), 41\u201353 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"10","key":"387_CR15","doi-asserted-by":"publisher","first-page":"6498","DOI":"10.1109\/TIT.2017.2777492","volume":"64","author":"G Luo","year":"2018","unstructured":"Luo, G., Cao, X.: Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum. IEEE Trans. Inf. Theory 64(10), 6498\u20136505 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"387_CR16","first-page":"43","volume":"40","author":"VI Levenshtein","year":"1983","unstructured":"Levenshtein, V.I.: Bounds for packing of metric spaces and some of their applications. Problem Cybern. 40, 43\u2013110 (1983)","journal-title":"Problem Cybern."},{"key":"387_CR17","unstructured":"Rahimi, F.: Covering Graphs and Equiangular Tight Frames. University of Waterloo, Ontario (2016). \n                    http:\/\/hdl.handle.net\/10012\/10793"},{"key":"387_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-1-4471-0551-0_6","volume-title":"Sequences and their Applications","author":"Dilip V. Sarwate","year":"1999","unstructured":"Sarwate, D.: Meeting the Welch bound with equality. In: Proceedings of SETA\u201998, pp. 79\u2013102. Springer, London (1999)"},{"issue":"3","key":"387_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S1063-5203(03)00023-X","volume":"14","author":"T Strohmer","year":"2003","unstructured":"Strohmer, T., Heath Jr., R.W.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257\u2013275 (2003)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"387_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"L Welch","year":"1974","unstructured":"Welch, L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inf. Theory 20(3), 397\u2013399 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"387_CR21","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1109\/TIT.2005.846411","volume":"51","author":"P Xia","year":"2005","unstructured":"Xia, P., Zhou, S., Giannakis, G.B.: Achieving the Welch bound with difference sets. IEEE Trans. Inf. Theory 51(5), 1900\u20131907 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"387_CR22","doi-asserted-by":"publisher","first-page":"6526","DOI":"10.1109\/TIT.2015.2487451","volume":"61","author":"C Xiang","year":"2015","unstructured":"Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61(12), 6526\u20136535 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"387_CR23","doi-asserted-by":"publisher","first-page":"7382","DOI":"10.1109\/TIT.2014.2353052","volume":"60","author":"Z Zhou","year":"2014","unstructured":"Zhou, Z., Ding, C., Li, N.: New families of codebooks achieving the levenstein bound. IEEE Trans. Inf. Theory 60(11), 7382\u20137387 (2014)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00387-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-019-00387-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00387-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T23:16:40Z","timestamp":1590535000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-019-00387-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,28]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s00200-019-00387-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,28]]},"assertion":[{"value":"26 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}