{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:18:25Z","timestamp":1757452705281,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T00:00:00Z","timestamp":1484697600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s12095-017-0212-2","type":"journal-article","created":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T06:55:33Z","timestamp":1484722533000},"page":"729-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sequences of bent functions and near-bent functions"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8578-3950","authenticated-orcid":false,"given":"J.","family":"Wolfmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,18]]},"reference":[{"key":"212_CR1","doi-asserted-by":"crossref","first-page":"2004","DOI":"10.1109\/TIT.2003.814476","volume":"49","author":"A Canteault","year":"2003","unstructured":"Canteault, A., Charpin, P.: Decomposing Bent Functions. IEEE Trans. Inf. Theory 49, 2004\u20132019 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"212_CR2","unstructured":"Dillon, J.F.: Elementary Hadamard Difference Sets. Ph.D. Thesis, University of Maryland (1974)"},{"key":"212_CR3","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"AM Kerdock","year":"1972","unstructured":"Kerdock, A.M.: A class of low-rate non linear codes. Inf. Control. 20, 182\u2013187 (1972)","journal-title":"Inf. Control."},{"key":"212_CR4","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.jcta.2008.12.004","volume":"1164","author":"G Leander","year":"2009","unstructured":"Leander, G., McGuire, G.: Construction of Bent Functions from Near-Bent Functions. J. Comb. Theory Ser. A 1164, 960\u2013970 (2009)","journal-title":"J. Comb. Theory Ser. A"},{"key":"212_CR5","volume-title":"The Theory of Error Correcting Codes","author":"FJ Mac Williams","year":"1977","unstructured":"Mac Williams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"212_CR6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"OS Rothaus","year":"1976","unstructured":"Rothaus, O.S.: On bent functions. J. Comb. Theory Ser. A 20, 300\u2013305 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"212_CR7","doi-asserted-by":"crossref","unstructured":"Wolfmann, J.: Bent Functions and Coding Theory. Difference Sets, Sequences and their Correlation properties Pott, A., Kumar, P.V., Helleseth, T., Jungnickel, D. (eds.) . NATO Sciences Series, Series C,542, Kluwer Academic Publishers,393\u2013418 (1999)","DOI":"10.1007\/978-94-011-4459-9_16"},{"key":"212_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1090\/conm\/518\/10218","volume":"518","author":"J Wolfmann","year":"2010","unstructured":"Wolfmann, J.: Cyclic code aspects of bent functions.Finite Fields: Theory and Applications. AMS Ser. Contemp. Math. 518, 363\u2013384 (2010)","journal-title":"AMS Ser. Contemp. Math."},{"issue":"1","key":"212_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3934\/amc.2014.8.21","volume":"8","author":"J Wolfmann","year":"2014","unstructured":"Wolfmann, J.: Special Bent and Near-Bent Functions. Adv. Math. Commun. 8 (1), 21\u201333 (2014)","journal-title":"Adv. Math. Commun."},{"key":"212_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1090\/conm\/632\/12639","volume":"632","author":"J Wolfmann","year":"2015","unstructured":"Wolfmann, J.: From Near-Bent to Bent: A special Case. Topics in Finite Fields, AMS series. Contemp. Math. 632, 359\u2013371 (2015)","journal-title":"Contemp. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0212-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0212-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0212-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,3]],"date-time":"2017-08-03T03:31:11Z","timestamp":1501731071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0212-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,18]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0212-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2017,1,18]]}}}