{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T15:23:40Z","timestamp":1763997820929,"version":"3.45.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"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":"crossref","award":["12271137","U21A20428"],"award-info":[{"award-number":["12271137","U21A20428"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,12]]},"DOI":"10.1007\/s10623-025-01727-4","type":"journal-article","created":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:04:13Z","timestamp":1757171053000},"page":"5327-5356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Several new classes of MDS symbol-pair codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Xiujing","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Liqi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,6]]},"reference":[{"key":"1727_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00200-008-0063-3","volume":"19","author":"BV Asch","year":"2008","unstructured":"Asch B.V.: Matrix-product codes over finite chain rings. Appl. Algebra Eng. Commun. Comput. 19, 39\u201349 (2008).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"6","key":"1727_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/PL00004226","volume":"12","author":"T Blackmore","year":"2001","unstructured":"Blackmore T., Norton G.H.: Matrix-product codes over $${\\mathbb{F} }_q$$. Appl. Algebra Eng., Commun. Comput. 12(6), 477\u2013500 (2001).","journal-title":"Appl. Algebra Eng., Commun. Comput."},{"key":"1727_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto Y., Blaum M.: Codes for symbol-pair read channels. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 988\u2013992 (2010).","DOI":"10.1109\/ISIT.2010.5513753"},{"key":"1727_CR4","doi-asserted-by":"crossref","unstructured":"Cassuto Y., Litsyn S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 2348\u20132352 (2011).","DOI":"10.1109\/ISIT.2011.6033982"},{"key":"1727_CR5","doi-asserted-by":"publisher","first-page":"8011","DOI":"10.1109\/TIT.2011.2164891","volume":"57","author":"Y Cassuto","year":"2011","unstructured":"Cassuto Y., Blaum M.: Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 57, 8011\u20138020 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1727_CR6","doi-asserted-by":"crossref","unstructured":"Chee Y.M., Kiah H.M., Wang C.: Maximum distance separable symbol-pair codes. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 2886\u20132890 (2012).","DOI":"10.1109\/ISIT.2012.6284052"},{"issue":"11","key":"1727_CR7","doi-asserted-by":"publisher","first-page":"7259","DOI":"10.1109\/TIT.2013.2276615","volume":"59","author":"YM Chee","year":"2013","unstructured":"Chee Y.M., Ji L., Kiah H.M., Wang C., Yin J.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59(11), 7259\u20137267 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1727_CR8","doi-asserted-by":"publisher","first-page":"7661","DOI":"10.1109\/TIT.2017.2753250","volume":"63","author":"B Chen","year":"2017","unstructured":"Chen B., Lin L., Liu H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inf. Theory 63(12), 7661\u20137666 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1727_CR9","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s10623-017-0365-1","volume":"86","author":"B Ding","year":"2018","unstructured":"Ding B., Ge G., Zhang J., Zhang T., Zhang Y.: New constructions of MDS symbol-pair codes. Des. Codes Cryptogr. 86(4), 841\u2013859 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1727_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ffa.2017.10.002","volume":"49","author":"B Ding","year":"2018","unstructured":"Ding B., Zhang T., Ge G.: Maximum distance separable codes for $$b$$-symbol read channels. Finite Fields Appl. 49(1), 180\u2013197 (2018).","journal-title":"Finite Fields Appl."},{"key":"1727_CR11","doi-asserted-by":"publisher","first-page":"145039","DOI":"10.1109\/ACCESS.2019.2944483","volume":"7","author":"HQ Dinh","year":"2019","unstructured":"Dinh H.Q., Kumam P., Kumar P., Satpati S., Singh A.K., Yamaka W.: MDS symbol-pair repeated-root constacyclic codes of prime power lengths over $${\\mathbb{F} }_{p^m}+ u {\\mathbb{F} }_{p^m}$$. IEEE Access 7, 145039\u2013145048 (2019).","journal-title":"IEEE Access"},{"key":"1727_CR12","first-page":"111","volume":"34","author":"HQ Dinh","year":"2021","unstructured":"Dinh H.Q., Kumar N., Singh A.K., Singh M.K., Gupta I., Maneejuk P.: On the symbol-pair distances of some classes of repeated-root constacyclic codes over Galois ring. Appl. Algebra Eng. Commun. Comput. 34, 111\u2013128 (2021).","journal-title":"Commun. Comput."},{"issue":"2","key":"1727_CR13","doi-asserted-by":"publisher","first-page":"2400","DOI":"10.1109\/LCOMM.2018.2868637","volume":"22","author":"HQ Dinh","year":"2018","unstructured":"Dinh H.Q., Nguyen B.T., Singh A.K., Sriboonchitta S.: Hamming and symbol-pair distances of repeated-root constacyclic codes of prime power lengths over $${\\mathbb{F} }_{p^m}+u{\\mathbb{F} }_{p^m}$$. IEEE Commun. Lett. 22(2), 2400\u20132403 (2018).","journal-title":"IEEE Commun. Lett."},{"issue":"1","key":"1727_CR14","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TIT.2019.2941885","volume":"66","author":"HQ Dinh","year":"2020","unstructured":"Dinh H.Q., Nguyen B.T., Sriboonchitta S.: MDS symbol-pair cyclic codes of length $$2p^s$$ over $${\\mathbb{F} }_{p^m}$$. IEEE Trans. Inf. Theory 66(1), 240\u2013262 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1727_CR15","first-page":"1027","volume":"34","author":"HQ Dinh","year":"2021","unstructured":"Dinh H.Q., Singh A.K., Thakur M.K.: On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${{\\mathbb{F} }}_{p^m}+u{{\\mathbb{F} }}_{p^m}$$ and MDS symbol-pair codes. Appl. Algebra Eng. Commun. Comput. 34, 1027\u20131043 (2021).","journal-title":"Commun. Comput."},{"key":"1727_CR16","doi-asserted-by":"publisher","first-page":"3062","DOI":"10.1016\/j.disc.2019.06.017","volume":"342","author":"HQ Dinh","year":"2019","unstructured":"Dinh H.Q., Wang X., Liu H., Sriboonchitta S.: On the symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$. Discret. Math. 342, 3062\u20133078 (2019).","journal-title":"Discret. Math."},{"key":"1727_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-012-9726-y","volume":"71","author":"Y Fan","year":"2013","unstructured":"Fan Y., Ling S., Liu H.: Matrix product codes over finite commutative Frobenius rings. Des. Codes Cryptogr. 71, 201\u2013227 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"1727_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00200-009-0113-5","volume":"20","author":"F Hernando","year":"2009","unstructured":"Hernando F., Lally K., Ruano D.: Construction and decoding of matrix-product codes from nested codes. Appl. Algebra Eng. Commun. Comput. 20, 497\u2013507 (2009).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1727_CR19","doi-asserted-by":"crossref","unstructured":"Hirotomo M., Takita M., Morii, M.: Syndrome decoding of symbol-pair codes. In: IEEE Information Theory Workshop, pp. 162\u2013166 (2014).","DOI":"10.1109\/ITW.2014.6970813"},{"key":"1727_CR20","doi-asserted-by":"crossref","unstructured":"Horii S., Matsushima T., Hirasawa, S.: Linear programming decoding of binary linear codes for symbol-pair read channels. In: IEEE International Symposium on Information Theory (ISIT), pp. 1944\u20131948 (2015).","DOI":"10.1109\/ISIT.2016.7541638"},{"issue":"11","key":"1727_CR21","doi-asserted-by":"publisher","first-page":"5828","DOI":"10.1109\/TIT.2015.2481889","volume":"61","author":"X Kai","year":"2015","unstructured":"Kai X., Zhu S., Li P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inf. Theory 61(11), 5828\u20135834 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1727_CR22","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/LCOMM.2018.2791422","volume":"22","author":"X Kai","year":"2018","unstructured":"Kai X., Zhu S., Zhao Y., Luo H., Chen Z.: New MDS symbol-pair codes from repeated-root codes. IEEE Commun. Lett. 22(3), 462\u2013465 (2018).","journal-title":"IEEE Commun. Lett."},{"key":"1727_CR23","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1007\/s10623-023-01184-x","volume":"91","author":"F Li","year":"2023","unstructured":"Li F.: Cyclic codes of length $$5p$$ with MDS symbol-pair. Des. Codes Cryptogr. 91, 1873\u20131888 (2023).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1727_CR24","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10623-016-0271-y","volume":"84","author":"S Li","year":"2017","unstructured":"Li S., Ge G.: Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes. Des. Codes Cryptogr. 84(3), 359\u2013372 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"1727_CR25","doi-asserted-by":"publisher","first-page":"4815","DOI":"10.1109\/TIT.2019.2904998","volume":"65","author":"S Liu","year":"2018","unstructured":"Liu S., Xing C., Yuan C.: List decodability of symbol-pair codes. IEEE Trans. Inf. Theory 65, 4815\u20134821 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1727_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.2022.3203591","volume":"69","author":"G Luo","year":"2023","unstructured":"Luo G., Ezerman M.F., Ling S.: Three new constructions of optimal locally repairable codes from matrix-product codes. IEEE Trans. Inf. Theory 69, 75\u201385 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1727_CR27","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/TIT.2022.3220638","volume":"69","author":"G Luo","year":"2023","unstructured":"Luo G., Ezerman M.F., Ling S., Pan X.: New families of MDS symbol-pair codes from matrix-product codes. IEEE Trans. Inf. Theory 69(3), 1567\u20131587 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1727_CR28","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12095-020-00455-x","volume":"13","author":"J Ma","year":"2020","unstructured":"Ma J., Luo J.: On symbol-pair weight distribution of MDS codes and simplex codes over finite fields. Cryptogr. Commun. 13, 101\u2013115 (2020).","journal-title":"Cryptogr. Commun."},{"key":"1727_CR29","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10623-021-00967-4","volume":"90","author":"J Ma","year":"2022","unstructured":"Ma J., Luo J.: MDS symbol-pair codes from repeated-root cyclic codes. Des. Codes Cryptogr. 90, 121\u2013137 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1727_CR30","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1007\/s10623-022-01081-9","volume":"90","author":"J Ma","year":"2022","unstructured":"Ma J., Luo J.: Constructions of MDS symbol-pair codes with minimum distance seven or eight. Des. Codes Cryptogr. 90, 2337\u20132359 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1727_CR31","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s12095-017-0249-2","volume":"10","author":"Z Sun","year":"2018","unstructured":"Sun Z., Zhu S., Wang L.: The symbol-pair distance distribution of a class of repeated-root cyclic codes over $${\\mathbb{F} }_{p^{m}}$$. Cryptogr. Commun. 10, 643\u2013653 (2018).","journal-title":"Cryptogr. Commun."},{"key":"1727_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102203","volume":"89","author":"X Tang","year":"2023","unstructured":"Tang X., Luo R.: MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes. Finite Fields Appl. 89, 102203 (2023).","journal-title":"Finite Fields Appl."},{"key":"1727_CR33","doi-asserted-by":"crossref","unstructured":"Yaakobi E., Bruck J., Siegel P.H.: Decoding of cyclic codes over symbol-pair read channels. In: IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2891\u20132895 (2012).","DOI":"10.1109\/ISIT.2012.6284053"},{"issue":"4","key":"1727_CR34","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1109\/TIT.2016.2522434","volume":"62","author":"E Yaakobi","year":"2016","unstructured":"Yaakobi E., Bruck J., Siegel P.H.: Constructions and decoding of cyclic codes over $$b$$-symbol read channels. IEEE Trans. Inf. Theory 62(4), 1541\u20131551 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1727_CR35","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1109\/LCOMM.2020.3041271","volume":"25","author":"W Zhao","year":"2021","unstructured":"Zhao W., Yang S., Shum K.W., Tang X.: Repeated-root constacyclic codes with pair-metric. IEEE Commun. Lett. 25(8), 2502\u20132506 (2021).","journal-title":"IEEE Commun. Lett."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01727-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01727-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01727-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T15:18:23Z","timestamp":1763997503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01727-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,6]]},"references-count":35,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1727"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01727-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,9,6]]},"assertion":[{"value":"3 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2025","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 declare that there is no possible conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}