{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:08Z","timestamp":1740148928520,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China under Grant","award":["11771392"],"award-info":[{"award-number":["11771392"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s12095-021-00472-4","type":"journal-article","created":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T19:03:24Z","timestamp":1614452604000},"page":"407-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes"],"prefix":"10.1007","volume":"13","author":[{"given":"Zhiwen","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8252-3881","authenticated-orcid":false,"given":"Jiejing","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"key":"472_CR1","unstructured":"Assmus Jr., E. F., Key, J. D.: Polynomial codes and finite geometries. In: Pless, V. S., Huffman, W. C. (eds.) The Handbook of Coding Theory, vol. II, pp 1269\u20131343. Elsevier, Amsterdam (1998)"},{"key":"472_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and their Codes","author":"EF Assmus Jr.","year":"1992","unstructured":"Assmus Jr., E. F., Key, J. D.: Designs and their Codes. Cambridge University Press, Cambridge (1992)"},{"key":"472_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/11101","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2018","unstructured":"Ding, C.: Designs from Linear Codes. World Scientific, Singapore (2018)"},{"key":"472_CR4","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s10623-019-00701-1","volume":"88","author":"C Ding","year":"2020","unstructured":"Ding, C., Tang, C., Tonchev, D.: Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. Des. Codes Cryptogr. 88, 625\u2013641 (2020)","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"472_CR5","doi-asserted-by":"publisher","first-page":"5419","DOI":"10.1109\/TIT.2020.2990396","volume":"66","author":"C Ding","year":"2020","unstructured":"Ding, C., Tang, C.: Infinite families of near MDS codes holding t-designs. IEEE Trans. Inf. Theory 66(9), 5419\u20135428 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"472_CR6","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10623-017-0352-6","volume":"86","author":"C Ding","year":"2018","unstructured":"Ding, C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86(3), 703\u2013719 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"472_CR7","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1016\/j.disc.2017.05.013","volume":"340","author":"C Ding","year":"2017","unstructured":"Ding, C., Li, C.: Infinite families of 2-designs and 3-designs from linear codes. Discrete Math. 340(10), 2415\u20132431 (2017)","journal-title":"Discrete Math."},{"key":"472_CR8","doi-asserted-by":"publisher","unstructured":"Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. Adv. Math. Commun., https:\/\/doi.org\/10.3934\/amc.2020106 (2020)","DOI":"10.3934\/amc.2020106"},{"key":"472_CR9","doi-asserted-by":"crossref","unstructured":"Du, X., Wang, R., Fan, C.: Infinite families of 2-designs from a class of cyclic codes with two non-zeros. arXiv:1904.04242[math.CO] (2019)","DOI":"10.1002\/jcd.21682"},{"key":"472_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W. C., Pless, V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"472_CR11","doi-asserted-by":"publisher","unstructured":"Tang, C., Ding, C.: An infinite family of linear codes supporting 4-designs. IEEE Trans. Inf. Theory, https:\/\/doi.org\/10.1109\/TIT.2020.3032600 (2020)","DOI":"10.1109\/TIT.2020.3032600"},{"key":"472_CR12","doi-asserted-by":"publisher","unstructured":"Wang, R., Du, X., Fan, C.: Infinite families of 2-designs from a class of non-binary Kasami cyclic codes. Adv. Math. Commun., https:\/\/doi.org\/10.3934\/amc.2020088 (2019)","DOI":"10.3934\/amc.2020088"},{"key":"472_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/8250","volume-title":"Finite Fields and Galois Rings","author":"Z Wan","year":"2011","unstructured":"Wan, Z.: Finite Fields and Galois Rings. World Scientific, USA (2011)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00472-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00472-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00472-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T11:34:44Z","timestamp":1620819284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00472-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["472"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00472-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"9 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}