{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:25:37Z","timestamp":1781828737763,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T00:00:00Z","timestamp":1720742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T00:00:00Z","timestamp":1720742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171398"],"award-info":[{"award-number":["12171398"]}],"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":["11901563"],"award-info":[{"award-number":["11901563"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2682020ZT101"],"award-info":[{"award-number":["2682020ZT101"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018542","name":"Natural Science Foundation of Sichuan Province","doi-asserted-by":"publisher","award":["2022NSFSC1856"],"award-info":[{"award-number":["2022NSFSC1856"]}],"id":[{"id":"10.13039\/501100018542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2021A1515010216"],"award-info":[{"award-number":["2021A1515010216"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10623-024-01450-6","type":"journal-article","created":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T09:02:16Z","timestamp":1720774936000},"page":"3573-3585","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Explicit constructions of NMDS self-dual codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Dongchun","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanbin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,12]]},"reference":[{"issue":"5","key":"1450_CR1","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s10623-021-00852-0","volume":"89","author":"A Aguglia","year":"2021","unstructured":"Aguglia A., Giuzzi L., Sonnino A.: Near-MDS codes from elliptic curves. Des. Codes Cryptogr. 89(5), 965\u2013972 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1450_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316257449","volume-title":"Finite Geometry and Combinatorial Applications: London Mathematical Society Student Texts","author":"S Ball","year":"2015","unstructured":"Ball S.: Finite Geometry and Combinatorial Applications: London Mathematical Society Student Texts, vol. 82. Cambridge University Press, Cambridge (2015)."},{"issue":"3","key":"1450_CR3","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/s10623-022-01141-0","volume":"91","author":"M Ceria","year":"2023","unstructured":"Ceria M., Cossidente A., Marino G., Pavese F.: On near-MDS codes and caps. Des. Codes Cryptogr. 91(3), 1095\u20131110 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1450_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices and Groups","author":"J Conway","year":"1999","unstructured":"Conway J., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn Springer, New York (1999).","edition":"3"},{"issue":"6","key":"1450_CR5","doi-asserted-by":"publisher","first-page":"2644","DOI":"10.1109\/TIT.2008.921692","volume":"54","author":"R Cramer","year":"2008","unstructured":"Cramer R., Daza V., Gracia I., Urroz J.J., Leander G., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On codes, matroids, and secure multiparty computation from linear secret-sharing schemes. IEEE Trans. Inf. Theory 54(6), 2644\u20132657 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1450_CR6","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":"1\u20132","key":"1450_CR7","first-page":"30","volume":"54","author":"S Dodunekov","year":"1994","unstructured":"Dodunekov S., Landjev I.: On near-MDS codes. J. Geom. 54(1\u20132), 30\u201343 (1994).","journal-title":"J. Geom."},{"key":"1450_CR8","doi-asserted-by":"crossref","unstructured":"Dougherty S.T., Mesnager S., Sole P.: Secret-sharing schemes based on self-dual codes. In: Proceedings of Information Theory Workshop, May 2008, pp. 338\u2013342 (2008).","DOI":"10.1109\/ITW.2008.4578681"},{"issue":"6","key":"1450_CR9","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/s10623-020-00734-x","volume":"88","author":"X Fang","year":"2020","unstructured":"Fang X., Lebed K., Liu H., Luo J.: New MDS self-dual codes over finite fields of odd characteristic. Des. Codes Cryptogr. 88(6), 1127\u20131138 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1450_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TIT.2020.3020986","volume":"67","author":"X Fang","year":"2021","unstructured":"Fang X., Liu M., Luo J.: New MDS Euclidean self-orthogonal codes. IEEE Trans. Inf. Theory 67(1), 130\u2013137 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1450_CR11","doi-asserted-by":"publisher","first-page":"5574","DOI":"10.1109\/TIT.2019.2916367","volume":"65","author":"W Fang","year":"2019","unstructured":"Fang W., Fu F.: New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes. IEEE Trans. Inf. Theory 65(9), 5574\u20135579 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1450_CR12","doi-asserted-by":"publisher","first-page":"5005","DOI":"10.1109\/TIT.2021.3085768","volume":"67","author":"W Fang","year":"2021","unstructured":"Fang W., Xia S., Fu F.: Construction of MDS Euclidean self-dual codes via two subsets. IEEE Trans. Inf. Theory 67(8), 5005\u20135015 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1450_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TIT.2023.3314059","volume":"70","author":"H Gu","year":"2024","unstructured":"Gu H., Zhang J.: On twisted generalized Reed\u2013Solomon codes with $$\\ell $$ twists. IEEE Trans. Inf. Theory 70(1), 145\u2013153 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1450_CR14","doi-asserted-by":"publisher","first-page":"4354","DOI":"10.1109\/TIT.2008.928297","volume":"54","author":"TA Gulliver","year":"2008","unstructured":"Gulliver T.A., Kim J.-L., Lee Y.: New MDS and near-MDS self-dual codes. IEEE Trans. Inf. Theory 54(9), 4354\u20134360 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1450_CR15","doi-asserted-by":"publisher","first-page":"7817","DOI":"10.1109\/TIT.2022.3194914","volume":"68","author":"Z Heng","year":"2022","unstructured":"Heng Z., Li C., Wang X.: Constructions of MDS, near MDS and almost MDS codes from cyclic subgroups of $$\\mathbb{F} _{q^2}^*$$. IEEE Trans. Inf. Theory 68(12), 7817\u20137831 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1450_CR16","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.1007\/s10623-021-00910-7","volume":"89","author":"D Huang","year":"2021","unstructured":"Huang D., Yue Q., Niu Y., Li X.: MDS or NMDS self-dual codes from twisted generalized Reed\u2013Solomon codes. Des. Codes Cryptogr. 89(9), 2195\u20132209 (2021).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1450_CR17","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1109\/TIT.2018.2880913","volume":"65","author":"L Jin","year":"2019","unstructured":"Jin L., Kan H.: Self-dual near MDS codes from elliptic curves. IEEE Trans. Inf. Theory 65(4), 2166\u20132170 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1450_CR18","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1109\/TIT.2016.2645759","volume":"63","author":"L Jin","year":"2017","unstructured":"Jin L., Xing C.: New MDS self-dual codes from generalized Reed\u2013Solomon codes. IEEE Trans. Inf. Theory 63(3), 1434\u20131438 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1450_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jcta.2003.10.003","volume":"105","author":"J Kim","year":"2004","unstructured":"Kim J., Lee Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Comb. Theory A 105(1), 79\u201395 (2004).","journal-title":"J. Comb. Theory A"},{"issue":"4","key":"1450_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.3934\/amc.2009.3.349","volume":"3","author":"IS Kotsireas","year":"2009","unstructured":"Kotsireas I.S., Koukouvinos C., Simos D.E.: MDS and near-MDS self-dual codes over large prime fields. Adv. Math. Commun. 3(4), 349\u2013361 (2009).","journal-title":"Adv. Math. Commun."},{"key":"1450_CR21","unstructured":"Landjev I., Rousseva A.: The main conjecture for near-MDS codes. In: Proceedings of the. 9th International Workshop on Coding Cryptography (WCC), 2015 (2015). https:\/\/www.hal.inria.fr\/hal-01276222\/document."},{"key":"1450_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ffa.2019.05.007","volume":"59","author":"K Lebed","year":"2019","unstructured":"Lebed K., Liu H., Luo J.: Construction of MDS self-dual codes over finite fields. Finite Fields Appl. 59, 199\u2013207 (2019).","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1450_CR23","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.ffa.2008.05.003","volume":"14","author":"J Li","year":"2008","unstructured":"Li J., Wan D.: On the subset sum problem over finite fields. Finite Fields Appl. 14(4), 911\u2013929 (2008).","journal-title":"Finite Fields Appl."},{"key":"1450_CR24","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)."},{"key":"1450_CR25","unstructured":"Simos D.E., Varbanov Z.: MDS Codes, NMDS Codes and Their Secret-Sharing Schemes (2018). http:\/\/singacom:uva:es\/edgar\/cactc2012\/trabajos\/CACT2012SimosVarbanov:pdf. Accessed April 2018."},{"issue":"12","key":"1450_CR26","doi-asserted-by":"publisher","first-page":"7832","DOI":"10.1109\/TIT.2022.3190676","volume":"68","author":"J Sui","year":"2022","unstructured":"Sui J., Yue Q., Li X., Huang D.: MDS, near-MDS or 2-MDS self-dual codes via twisted generalized Reed\u2013Solomon codes. IEEE Trans. Inf. Theory 68(12), 7832\u20137841 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1450_CR27","doi-asserted-by":"publisher","first-page":"1937","DOI":"10.1007\/s10623-022-01049-9","volume":"90","author":"J Sui","year":"2022","unstructured":"Sui J., Zhu X., Shi X.: MDS and near-MDS codes via twisted Reed\u2013Solomon codes. Des. Codes Cryptogr. 90(8), 1937\u20131958 (2022).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1450_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112277","volume":"344","author":"Q Wang","year":"2021","unstructured":"Wang Q., Heng Z.: Near MDS codes from oval polynomials. Discret. Math. 344(4), 112277 (2021).","journal-title":"Discret. Math."},{"issue":"9","key":"1450_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113490","volume":"346","author":"L Xu","year":"2023","unstructured":"Xu L., Fan C.: Near MDS codes of non-elliptic-curve type from Reed\u2013Solomon codes. Discret. Math. 346(9), 113490 (2023).","journal-title":"Discret. Math."},{"key":"1450_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102338","volume":"93","author":"L Xu","year":"2024","unstructured":"Xu L., Fan C., Han D.: Near-MDS codes from maximal arcs in PG$$(2, q)$$. Finite Fields Appl. 93, 102338 (2024).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1450_CR31","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12095-018-0288-3","volume":"11","author":"H Yan","year":"2019","unstructured":"Yan H.: A note on the constructions of MDS self-dual codes. Cryptogr. Commun. 11(2), 259\u2013268 (2019).","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"1450_CR32","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1109\/TIT.2020.2963975","volume":"66","author":"A Zhang","year":"2020","unstructured":"Zhang A., Feng K.: A unified approach to construct MDS self-dual codes via Reed\u2013Solomon codes. IEEE Trans. Inf. Theory 66(6), 3650\u20133656 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1450_CR33","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1007\/s10623-022-01064-w","volume":"90","author":"J Zhang","year":"2022","unstructured":"Zhang J., Zhou Z., Tang C.: A class of twisted generalized Reed\u2013Solomon codes. Des. Codes Cryptogr. 90(7), 1649\u20131658 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1450_CR34","doi-asserted-by":"crossref","unstructured":"Zhou Y., Wang F., Xin Y., Luo S., Qing S., Yang Y.: A secret sharing scheme based on near-MDS codes. In: Proceedings of IC-NIDC, 2009, pp. 833\u2013836 (2009).","DOI":"10.1109\/ICNIDC.2009.5360821"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01450-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01450-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01450-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T18:03:19Z","timestamp":1727632999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01450-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,12]]},"references-count":34,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1450"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01450-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,12]]},"assertion":[{"value":"29 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}