{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:29Z","timestamp":1776956069512,"version":"3.51.4"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:00:00Z","timestamp":1578700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:00:00Z","timestamp":1578700800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602144"],"award-info":[{"award-number":["61602144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471178"],"award-info":[{"award-number":["11471178"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571107"],"award-info":[{"award-number":["11571107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s12095-019-00421-2","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T07:02:50Z","timestamp":1578726170000},"page":"795-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The minimum distance of new generalisations of the punctured binary Reed-Muller codes"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0640-0956","authenticated-orcid":false,"given":"Liqin","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqin","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,11]]},"reference":[{"key":"421_CR1","volume-title":"Gauss and Jacobi Sums","author":"BC Berndt","year":"1998","unstructured":"Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi Sums. Wiley, New York (1998)"},{"key":"421_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ffa.2018.06.006","volume":"53","author":"C Ding","year":"2018","unstructured":"Ding, C., Li, C., Xia, Y.: Another generalisation of the binary Reed-Muller codes and its applications. Finite Fields Appl. 53, 144\u2013174 (2018)","journal-title":"Finite Fields Appl."},{"key":"421_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0019-9958(70)90214-7","volume":"16","author":"P Delsarte","year":"1972","unstructured":"Delsarte, P., Goethals, J.M., MacWilliams, F.J.: On generalized Reed-Muller codes and their relatives. Inf. Control 16, 403\u2013442 (1972)","journal-title":"Inf. Control"},{"key":"421_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami, T., Lin, S., Peterson, W.: New generalisations of the Reed-Muller codes, Part 1: primitive codes. IEEE Trans. Inf. Theory 14, 189\u2013199 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"421_CR5","first-page":"6","volume":"3","author":"DE Muller","year":"1954","unstructured":"Muller, D.E., Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IEEE Trans. Comput. 3, 6\u201312 (1954)","journal-title":"IEEE Trans. Comput."},{"key":"421_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TIT.1954.1057465","volume":"4","author":"IS Reed","year":"1954","unstructured":"Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IRE Trans. Inf. Theory 4, 38\u201349 (1954)","journal-title":"IRE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00421-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-00421-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00421-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T02:46:42Z","timestamp":1610246802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-00421-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["421"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-00421-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,11]]},"assertion":[{"value":"28 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}