{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T09:41:05Z","timestamp":1656495665104},"reference-count":39,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<p style='text-indent:20px;'>In this paper, based on the theory of <inline-formula><tex-math id=\"M2\">\\begin{document}$ \\mathbb{Z}_{4} $\\end{document}<\/tex-math><\/inline-formula>-valued quadratic forms we propose several classes of generalized Boolean bent functions over <inline-formula><tex-math id=\"M3\">\\begin{document}$ \\mathbb{Z}_{4} $\\end{document}<\/tex-math><\/inline-formula>, and new families of codebooks are constructed from these functions. The codebooks constructed in this paper are nearly optimal with respect to the Welch bound, and their parameters are new. Furthermore, some Boolean bent functions are also derived.<\/p><\/jats:p>","DOI":"10.3934\/amc.2020121","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T11:56:31Z","timestamp":1610106991000},"page":"485","source":"Crossref","is-referenced-by-count":0,"title":["Nearly optimal codebooks from generalized Boolean bent functions over $ \\mathbb{Z}_{4} $"],"prefix":"10.3934","volume":"16","author":[{"given":"Junchao","family":"Zhou","sequence":"first","affiliation":[{"name":"Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China"},{"name":"Faculty of Mathematics and Statistics, Hubei Engineering University, Xiaogan, 432000, China"}]},{"given":"Yunge","family":"Xu","sequence":"additional","affiliation":[{"name":"Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China"}]},{"given":"Lisha","family":"Wang","sequence":"additional","affiliation":[{"name":"Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China"}]},{"given":"Nian","family":"Li","sequence":"additional","affiliation":[{"name":"Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020121-1","doi-asserted-by":"publisher","unstructured":"E. H. Brown.Generalizations of the Kervaire invariant, Annals. Math.<\/i>, 95<\/b> (1972), 368-383.","DOI":"10.2307\/1970804"},{"key":"key-10.3934\/amc.2020121-2","doi-asserted-by":"publisher","unstructured":"X. Cao, W. Chou, X. Zhang.More constructions of near optimal codebooks associated with binary sequences, Adv. Math. Commun.<\/i>, 11<\/b> (2017), 187-202.","DOI":"10.3934\/amc.2017012"},{"key":"key-10.3934\/amc.2020121-3","doi-asserted-by":"publisher","unstructured":"C. Carlet, S. Mesnager.Four decades of research on bent functions, Des. Codes Cryptogr.<\/i>, 78<\/b> (2016), 5-50.","DOI":"10.1007\/s10623-015-0145-8"},{"key":"key-10.3934\/amc.2020121-4","doi-asserted-by":"publisher","unstructured":"P. Charpin, E. Pasalic, C. Tavernier.On bent and semi-bent quadratic Boolean functions, IEEE Trans. Inf. Theory<\/i>, 51<\/b> (2005), 4286-4298.","DOI":"10.1109\/TIT.2005.858929"},{"key":"key-10.3934\/amc.2020121-5","doi-asserted-by":"publisher","unstructured":"C. Ding.Complex codebooks from combinatorial designs, IEEE Trans. Inf. Theory<\/i>, 52<\/b> (2006), 4229-4235.","DOI":"10.1109\/TIT.2006.880058"},{"key":"key-10.3934\/amc.2020121-6","doi-asserted-by":"publisher","unstructured":"C. Ding, T. Feng.A generic construction of complex codebooks meeting the Welch bound, IEEE Trans. Inf. Theory<\/i>, 53<\/b> (2007), 4245-4250.","DOI":"10.1109\/TIT.2007.907343"},{"key":"key-10.3934\/amc.2020121-7","doi-asserted-by":"publisher","unstructured":"C. Ding, T. Feng.Codebooks from almost difference sets, Des. Codes Cryptogr.<\/i>, 46<\/b> (2008), 113-126.","DOI":"10.1007\/s10623-007-9140-z"},{"key":"key-10.3934\/amc.2020121-8","doi-asserted-by":"publisher","unstructured":"C. Ding, J. Yin.Signal sets from functions with optimimum nonlinearity, IEEE Trans. Communications<\/i>, 55<\/b> (2007), 936-940.","DOI":"10.1109\/TCOMM.2007.894113"},{"key":"key-10.3934\/amc.2020121-9","doi-asserted-by":"publisher","unstructured":"A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, P. Sole.The ${\\mathbb Z}_4$-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inf. Theory<\/i>, 40<\/b> (1994), 301-319.","DOI":"10.1109\/18.312154"},{"key":"key-10.3934\/amc.2020121-10","doi-asserted-by":"publisher","unstructured":"Z. Heng.Nearly optimal codebooks based on generalized Jacobi sums, Dis. Appli. Math.<\/i>, 250<\/b> (2018), 227-240.","DOI":"10.1016\/j.dam.2018.05.017"},{"key":"key-10.3934\/amc.2020121-11","doi-asserted-by":"publisher","unstructured":"Z. Heng, C. Ding, Q. Yue.New constructions of asymptotically optimal codebooks with multiplicative characters, IEEE Trans. Inf. Theory<\/i>, 63<\/b> (2017), 6179-6187.","DOI":"10.1109\/TIT.2017.2693204"},{"key":"key-10.3934\/amc.2020121-12","doi-asserted-by":"publisher","unstructured":"Z. Heng, Q. Yue.Optimal codebooks achieving the Levenshtein bound from generalized bent functions over $\\mathbb{Z}_4$, Cryptogr. Commun.<\/i>, 9<\/b> (2017), 41-53.","DOI":"10.1007\/s12095-016-0194-5"},{"key":"key-10.3934\/amc.2020121-13","doi-asserted-by":"publisher","unstructured":"S. Hong, H. Park, T. Helleseth, Y. Kim.Near-optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping, IEEE Trans. Inf. Theory<\/i>, 60<\/b> (2014), 3698-3705.","DOI":"10.1109\/TIT.2014.2314298"},{"key":"key-10.3934\/amc.2020121-14","doi-asserted-by":"publisher","unstructured":"H. Hu, J. Wu.New constructions of codebooks nearly meeting the Welch bound with equality, IEEE Trans. Inf. Theory<\/i>, 60<\/b> (2014), 1348-1355.","DOI":"10.1109\/TIT.2013.2292745"},{"key":"key-10.3934\/amc.2020121-15","unstructured":"V. I. Levenshtein.Bounds for packing of metric spaces and some of their applications, Probl. Cybern.<\/i>, 40<\/b> (1983), 43-110."},{"key":"key-10.3934\/amc.2020121-16","doi-asserted-by":"publisher","unstructured":"C. Li, Q. Yue, Y. Huang.Two families of nearly optimal codebooks, Des. Codes Cryptogr.<\/i>, 75<\/b> (2015), 43-57.","DOI":"10.1007\/s10623-013-9891-7"},{"key":"key-10.3934\/amc.2020121-17","doi-asserted-by":"publisher","unstructured":"N. Li, X. Tang, T. Helleseth.New constructions of quadratic bent functions in polynomial form, IEEE Trans. Inf. Theory<\/i>, 60<\/b> (2014), 5760-5767.","DOI":"10.1109\/TIT.2014.2339861"},{"key":"key-10.3934\/amc.2020121-18","unstructured":"R. Lidl and H. Niederreiter, Finite Fields<\/i>, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, England, 1997."},{"key":"key-10.3934\/amc.2020121-19","doi-asserted-by":"publisher","unstructured":"W. Lu, X. Wu, X. Cao and M. Chen, Six constructions of asymptotically optimal codebooks via the character sums, Des. Codes Cryptogr.<\/i>, 88<\/b> (2020), 1139-1158.","DOI":"10.1007\/s10623-020-00735-w"},{"key":"key-10.3934\/amc.2020121-20","doi-asserted-by":"publisher","unstructured":"G. Luo, X. Cao.Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum, IEEE Trans. Inf. Theory<\/i>, 64<\/b> (2018), 6498-6505.","DOI":"10.1109\/TIT.2017.2777492"},{"key":"key-10.3934\/amc.2020121-21","doi-asserted-by":"crossref","unstructured":"G. Luo and X. Cao, New constructions of codebooks asymptotically achieving the Welch bound, 2018 IEEE International Symposium on Information Theory<\/i>, (2018), 2346\u20132350.","DOI":"10.1109\/ISIT.2018.8437838"},{"key":"key-10.3934\/amc.2020121-22","doi-asserted-by":"publisher","unstructured":"S. Mesnager, Bent Functions: Fundamentals and Results<\/i>, Springer-Verlag, 2016.","DOI":"10.1007\/978-3-319-32595-8"},{"key":"key-10.3934\/amc.2020121-23","doi-asserted-by":"publisher","unstructured":"Y. Qi, S. Mesnager, C. Tang, Codebooks from generalized bent $\\mathbb{Z}_{4}$-valued quadratic forms, Discret. Math.<\/i>, 343<\/b> (2020), 111736.","DOI":"10.1016\/j.disc.2019.111736"},{"key":"key-10.3934\/amc.2020121-24","unstructured":"L. Qian, X. Cao, W. Lu and X. Wu, New constructions of asymptotically optimal codebooks via character sums over a local ring, preprint, arXiv: 1906.05523."},{"key":"key-10.3934\/amc.2020121-25","doi-asserted-by":"publisher","unstructured":"O. S. Rothaus.On \"bent\" functions, J. Combin. Theory Ser. A<\/i>, 20<\/b> (1976), 300-305.","DOI":"10.1016\/0097-3165(76)90024-8"},{"key":"key-10.3934\/amc.2020121-26","doi-asserted-by":"crossref","unstructured":"D. V. Sarwate, Meeting the Welch bound with equality, Sequences and Their Applications<\/i>, Springer London, 1999, 79\u2013102.","DOI":"10.1007\/978-1-4471-0551-0_6"},{"key":"key-10.3934\/amc.2020121-27","doi-asserted-by":"publisher","unstructured":"K. Schmidt.${\\mathbb Z}_4$-valued quadratic forms and quaternary sequence families, IEEE Trans. Inf. Theory<\/i>, 55<\/b> (2009), 5803-5810.","DOI":"10.1109\/TIT.2009.2032818"},{"key":"key-10.3934\/amc.2020121-28","unstructured":"P. Sol$\\acute{e}$ and N. Tokareva, Connections between quaternary and binary bent functions, 2009. Available from: https:\/\/eprint.iacr.org\/2009\/544.pdf<\/a>."},{"key":"key-10.3934\/amc.2020121-29","doi-asserted-by":"publisher","unstructured":"P. Tan, Z. Zhou, D. Zhang.A construction of codebooks nearly achieving the Levenshtein bound, IEEE Signal Process. Lett.<\/i>, 23<\/b> (2016), 1306-1309.","DOI":"10.1109\/LSP.2016.2595106"},{"key":"key-10.3934\/amc.2020121-30","doi-asserted-by":"publisher","unstructured":"L. Welch.Lower bounds on the maximum cross correlation of signal, IEEE Trans. Inf. Theory<\/i>, 20<\/b> (1974), 397-399.","DOI":"10.1109\/TIT.1974.1055219"},{"key":"key-10.3934\/amc.2020121-31","doi-asserted-by":"publisher","unstructured":"X. Wu, W. Lu, X. Cao.Two constructions of asymptotically optimal codebooks via the trace functions, Cryptogr. Commun.<\/i>, 12<\/b> (2020), 1195-1211.","DOI":"10.1007\/s12095-020-00448-w"},{"key":"key-10.3934\/amc.2020121-32","doi-asserted-by":"publisher","unstructured":"P. Xia, S. Zhou, G. B. Giannakis.Achieving the Welch bound with difference sets, IEEE Trans. Inf. Theory<\/i>, 51<\/b> (2005), 1900-1907.","DOI":"10.1109\/TIT.2005.846411"},{"key":"key-10.3934\/amc.2020121-33","doi-asserted-by":"publisher","unstructured":"C. Xiang, C. Ding, S. Mesnager.Optimal codebooks from binary codes meeting the Levenshtein bound, IEEE Trans. Inf. Theory<\/i>, 61<\/b> (2015), 6526-6535.","DOI":"10.1109\/TIT.2015.2487451"},{"key":"key-10.3934\/amc.2020121-34","doi-asserted-by":"publisher","unstructured":"W. Yin, C. Xiang, F. Fu.A further construction of asymptotically optimal codebooks with multiplicative characters, Appl. Algebra Eng. Commun. Comput.<\/i>, 30<\/b> (2019), 453-469.","DOI":"10.1007\/s00200-019-00387-x"},{"key":"key-10.3934\/amc.2020121-35","doi-asserted-by":"publisher","unstructured":"N. Y. Yu.A construction of codebooks associated with binary sequences, IEEE Trans. Inf. Theory<\/i>, 58<\/b> (2012), 5522-5533.","DOI":"10.1109\/TIT.2012.2196021"},{"key":"key-10.3934\/amc.2020121-36","doi-asserted-by":"publisher","unstructured":"A. Zhang, K. Feng.Two classes of codebooks nearly meeting the Welch bound, IEEE Trans. Inf. Theory<\/i>, 58<\/b> (2012), 2507-2511.","DOI":"10.1109\/TIT.2011.2176531"},{"key":"key-10.3934\/amc.2020121-37","doi-asserted-by":"publisher","unstructured":"A. Zhang, K. Feng.Construction of cyclotomic codebooks nearly meeting the Welch bound, Des. Codes Cryptogr.<\/i>, 63<\/b> (2012), 209-224.","DOI":"10.1007\/s10623-011-9549-2"},{"key":"key-10.3934\/amc.2020121-38","doi-asserted-by":"publisher","unstructured":"Z. Zhou, C. Ding, N. Li.New families of codebooks achieving the Levenshtein bound, IEEE Trans. Inf. Theory<\/i>, 60<\/b> (2014), 7382-7387.","DOI":"10.1109\/TIT.2014.2353052"},{"key":"key-10.3934\/amc.2020121-39","doi-asserted-by":"publisher","unstructured":"Z. Zhou, X. Tang.New nearly optimal codebooks from relative difference sets, Adv. Math. Commun.<\/i>, 5<\/b> (2011), 521-527.","DOI":"10.3934\/amc.2011.5.521"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2020121?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T09:26:16Z","timestamp":1656494776000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_3_485"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020121","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}