{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T04:36:40Z","timestamp":1767415000115},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s12095-023-00652-4","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T06:02:01Z","timestamp":1687240921000},"page":"1129-1137","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Classification of some cosets of the Reed-Muller code"],"prefix":"10.1007","volume":"15","author":[{"given":"Val\u00e9rie","family":"Gillot","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Langevin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"issue":"1","key":"652_CR1","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1109\/TIT.2021.3120754","volume":"68","author":"R Dougherty","year":"2022","unstructured":"Dougherty, R., Mauldin, R.D., Tiefenbruck, M.: The covering radius of the Reed-Muller code $$RM(m-4, m)$$ in $$RM(m-3, m)$$. IEEE Trans. Inform. Theory. 68(1), 560\u2013571 (2022)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"652_CR2","doi-asserted-by":"crossref","unstructured":"Gao, J., Kan, H., Li, Y., Wang, Q.: The covering radius of the third-order reed-muller code rm(3,7) is 20. IEEE Trans. Inf. Theory, 69(6):3663\u20133673, 2023","DOI":"10.1109\/TIT.2023.3242966"},{"key":"652_CR3","unstructured":"Gillot, V., Langevin, P.: Classification of $$b(s,t,7)$$. (2022). http:\/\/langevin.univ-tln.fr\/project\/agl7\/aglclass.html"},{"issue":"3","key":"652_CR4","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1006\/jabr.1995.1043","volume":"171","author":"X-D Hou","year":"1995","unstructured":"Hou, X.-D.: AGL($$m,2$$) acting on $$R(r, m)\/R(s, m)$$. J. Algebra. 171(3), 921\u2013938 (1995)","journal-title":"J. Algebra."},{"key":"652_CR5","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/190","volume-title":"Lectures on finite fields","author":"X-D Hou","year":"2018","unstructured":"Hou, X.-D.: Lectures on finite fields. Graduate Studies in Mathematics, vol. 190. American Mathematical Society, Providence (2018)"},{"issue":"195","key":"652_CR6","first-page":"403","volume":"57","author":"JA Maiorana","year":"1991","unstructured":"Maiorana, J.A.: A classification of the cosets of the Reed-Muller code $$R$$(1,6). Math. Comp. 57(195), 403\u2013414 (1991)","journal-title":"Math. Comp."},{"key":"652_CR7","unstructured":"Qingshu, M., Huanguo, Z., Jingsong, C., Min, Y.: Almost enumeration of 8-variable bent functions. IACR Cryptol. ePrint Arch., p.\u00a0100, (2005)"},{"key":"652_CR8","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation group algorithms","author":"\u00c1 Seress","year":"2003","unstructured":"Seress, \u00c1.: Permutation group algorithms. Cambridge Tracts in Mathematics, vol. 152. Cambridge University Press, Cambridge (2003)"},{"key":"652_CR9","doi-asserted-by":"crossref","unstructured":"Wang, Q.: The covering radius of the Reed-Muller code RM(2,7) is 40. Discret. Math., 342(12), 111625, 7, (2019)","DOI":"10.1016\/j.disc.2019.111625"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00652-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00652-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00652-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T16:23:41Z","timestamp":1717431821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00652-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,20]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["652"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00652-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2023,6,20]]},"assertion":[{"value":"27 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}