{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:37:03Z","timestamp":1787510223110,"version":"build-2736575974"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tit.2016.2530795","type":"journal-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T14:16:24Z","timestamp":1455632184000},"page":"2277-2282","source":"Crossref","is-referenced-by-count":15,"title":["Patterson\u2013Wiedemann Type Functions on 21 Variables With Nonlinearity Greater Than Bent Concatenation Bound"],"prefix":"10.1109","volume":"62","author":[{"given":"Selcuk","family":"Kavut","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhamoy","family":"Maitra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","author":"kavut","year":"2015","journal-title":"Patterson&#x2013;Wiedemann Type Functions on 21 Variables With Nonlinearity Greater Than Bent Concatenation Bound"},{"key":"ref11","author":"kavut","year":"2016","journal-title":"Steepest-Descent-Like Search Algorithm Heuristic Search to Find 21-Variable PW Type Functions With NL > 1047552"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.971756"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056187"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056679"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9181-y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.761276"},{"key":"ref3","first-page":"237","article-title":"Elementary Hadamard difference sets","author":"dillon","year":"1975","journal-title":"Proc 6th S E Conf Combinat Graph Theory Comput Utility Math"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.370141"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.06.033"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.12.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.894696"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054732"},{"key":"ref1","first-page":"51","article-title":"Chapter 5: The steepest descent method","author":"bartholomew-biggs","year":"2005","journal-title":"Nonlinear optimization with financial applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.07.044"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7434091\/07407638.pdf?arnumber=7407638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:03:13Z","timestamp":1641985393000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7407638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":16,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2530795","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}