{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:44:46Z","timestamp":1773261886300,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071321"],"award-info":[{"award-number":["12071321"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10623-023-01304-7","type":"journal-article","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T15:01:55Z","timestamp":1696086115000},"page":"211-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The properties and the error-correcting pair for lengthened GRS codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Boyi","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qunying","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"1304_CR1","doi-asserted-by":"crossref","unstructured":"Beelen P., Puchinger S., Nielsen J.: Twisted Reed-Solomon codes. IEEE ISIT, 334\u2013336 (2017).","DOI":"10.1109\/ISIT.2017.8006545"},{"issue":"5","key":"1304_CR2","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1109\/TIT.2022.3146254","volume":"68","author":"P Beelen","year":"2022","unstructured":"Beelen P., Puchinger S., Rosenkilde J.: Twisted Reed-Solomon codes. IEEE Trans. Inf. Theory 68(5), 3047\u20133061 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1304_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01222850","volume":"54","author":"S Dodunekov","year":"1995","unstructured":"Dodunekov S., Landgev I.: On near-MDS codes. J. Geom. 54(1), 30\u201343 (1995).","journal-title":"J. Geom."},{"key":"1304_CR4","unstructured":"Duursma I.: Decoding codes from curves and cyclic codes. Ph.D. Thesis, Eindhoven University of Technology (1993)."},{"issue":"4","key":"1304_CR5","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1109\/18.335964","volume":"40","author":"I Duursma","year":"1994","unstructured":"Duursma I., K\u00f6tter R.: Error-locating pairs for cyclic codes. IEEE Trans. Inf. Theory 40(4), 1108\u20131121 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1304_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102210","author":"B He","year":"2023","unstructured":"He B., Liao Q.: On the error-correcting pair for MDS linear codes with even minimum distance. Finite Fields Appl. (2023). https:\/\/doi.org\/10.1016\/j.ffa.2023.102210.","journal-title":"Finite Fields Appl."},{"key":"1304_CR7","doi-asserted-by":"publisher","unstructured":"He B., Liao Q.: The error-correcting pair for TGRS codes. Discret. Math. (2023). https:\/\/doi.org\/10.1016\/j.disc.2023.113497346(9).","DOI":"10.1016\/j.disc.2023.113497346(9)"},{"key":"1304_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W Huffman","year":"2003","unstructured":"Huffman W., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"issue":"3","key":"1304_CR9","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-Solomon codes. IEEE Trans. Inf. Theory 63(3), 1434\u20131438 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1304_CR10","unstructured":"K\u00f6tter R.: A Unified Description of an Error-Locating Procedure for Linear Codes, pp. 113\u2013117. Pro. ACCT, Voneshta Voda (1992)."},{"key":"1304_CR11","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":"1304_CR12","doi-asserted-by":"crossref","unstructured":"Mrquez-Corbella I., Pellikaan R.: Error-correcting pairs for a public key cryptosystem. J. Phys. Conf. Ser. 855(1) (2012).","DOI":"10.1088\/1742-6596\/855\/1\/012032"},{"key":"1304_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.ffa.2016.04.004","volume":"40","author":"I Mrquez-Corbella","year":"2016","unstructured":"Mrquez-Corbella I., Pellikaan R.: A characterization of MDS codes that have an error-correcting pair. Finite Fields Appl. 40, 224\u2013245 (2016).","journal-title":"Finite Fields Appl."},{"key":"1304_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10623-012-9694-2","volume":"66","author":"I Mrquez-Corbella","year":"2013","unstructured":"Mrquez-Corbella I., Martnez-Moro E., Pellikaan R.: The non-gap sequence of a subcode of a generalized Reed-Solomon code. Des. Codes Cryptogr. 66, 317\u2013333 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"1304_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0012-365X(92)90567-Y","volume":"106","author":"R Pellikaan","year":"1992","unstructured":"Pellikaan R.: On decoding by error-location and dependent sets of error positions. Discret. Math. 106, 369\u2013381 (1992).","journal-title":"Discret. Math."},{"issue":"2","key":"1304_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0378-3758(95)00088-7","volume":"51","author":"R Pellikaan","year":"1996","unstructured":"Pellikaan R.: On the existence of error-correcting pairs. J. Stat. Plan. Inference 51(2), 229\u2013242 (1996).","journal-title":"J. Stat. Plan. Inference"},{"issue":"6","key":"1304_CR17","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/18.45279","volume":"35","author":"R Pellikaan","year":"1989","unstructured":"Pellikaan R.: On a decoding algorithm of codes on maximal curves. IEEE Trans. Inf. Theory 35(6), 1228\u20131232 (1989).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1304_CR18","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/18.30988","volume":"35","author":"RM Roth","year":"1989","unstructured":"Roth R.M., Lempel A.: A construction of non-Reed-Solomon type MDS codes. IEEE Trans. Inf. Theory 35(3), 655\u2013657 (1989).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1304_CR19","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/TIT.1985.1057113","volume":"31","author":"RM Roth","year":"1985","unstructured":"Roth R.M., Seroussi G.: On generator matrices of MDS codes (Corresp.). IEEE Trans. Inf. Theory 31(6), 826\u2013830 (1985).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01304-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01304-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01304-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T18:26:55Z","timestamp":1704997615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01304-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,30]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1304"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01304-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,30]]},"assertion":[{"value":"31 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}