{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T02:27:33Z","timestamp":1768789653972,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T00:00:00Z","timestamp":1635465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T00:00:00Z","timestamp":1635465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871025"],"award-info":[{"award-number":["11871025"]}],"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":["11471008"],"award-info":[{"award-number":["11471008"]}],"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":["12171191"],"award-info":[{"award-number":["12171191"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities of CCNU","award":["CCNU20TD002"],"award-info":[{"award-number":["CCNU20TD002"]}]},{"name":"Application Foundation Frontier Project of Wuhan Science and Technology Bureau","award":["2020010601012189"],"award-info":[{"award-number":["2020010601012189"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10623-021-00967-4","type":"journal-article","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T18:02:46Z","timestamp":1635530566000},"page":"121-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["MDS symbol-pair codes from repeated-root cyclic codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Junru","family":"Ma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6703-7241","authenticated-orcid":false,"given":"Jinquan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,29]]},"reference":[{"key":"967_CR1","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"},{"issue":"12","key":"967_CR2","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(12), 8011\u20138020 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"967_CR3","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"},{"issue":"2","key":"967_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G Castagnoli","year":"1991","unstructured":"Castagnoli G., Massey J.L., Schoeller P.A., von Seemann N.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 337\u2013342 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"967_CR5","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":"967_CR6","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":"9","key":"967_CR7","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1109\/TIT.2015.2451656","volume":"61","author":"B Chen","year":"2015","unstructured":"Chen B., Dihn H.Q., Fan Y., Ling S.: Polynomial constacyclic codes. IEEE Trans. Inf. Theory 61(9), 4895\u20134904 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"967_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":"967_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":"12","key":"967_CR10","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(12), 2400\u20132403 (2018).","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"967_CR11","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"HQ Dinh","year":"2018","unstructured":"Dinh H.Q., Nguyen B.T., Singh A.K., Sriboonchitta S.: On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths. IEEE Trans. Inf. Theory 64(4), 2417\u20132430 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"967_CR12","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(11), 3062\u20133078 (2019).","journal-title":"Discret. Math."},{"issue":"1","key":"967_CR13","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"},{"issue":"3","key":"967_CR14","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1109\/TIT.2019.2942283","volume":"66","author":"O Elishco","year":"2020","unstructured":"Elishco O., Gabrys R., Yaakobi E.: Bounds and constructions of codes over symbol-pair read channels. IEEE Trans. Inf. Theory 66(3), 1385\u20131395 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"967_CR15","doi-asserted-by":"crossref","unstructured":"Horii S., Matsushima T., Hirasawa S.: Linear programming decoding of binary linear codes for symbol-pair read channels. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 1944\u20131948 (2016)","DOI":"10.1109\/ISIT.2016.7541638"},{"key":"967_CR16","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)."},{"issue":"11","key":"967_CR17","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":"967_CR18","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."},{"issue":"3","key":"967_CR19","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."},{"issue":"8","key":"967_CR20","doi-asserted-by":"publisher","first-page":"4815","DOI":"10.1109\/TIT.2019.2904998","volume":"65","author":"S Liu","year":"2019","unstructured":"Liu S., Xing C., Yuan C.: List decodability of symbol-pair codes. IEEE Trans. Inf. Theory 65(8), 4815\u20134821 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"967_CR21","doi-asserted-by":"crossref","unstructured":"Ma J., Luo J.: New MDS symbol-pair codes from repeated-root cyclic codes over finite fields. http:\/\/arxiv.org\/abs\/2010.04329 (2020)","DOI":"10.1007\/s10623-021-00967-4"},{"issue":"1","key":"967_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12095-020-00455-x","volume":"13","author":"J Ma","year":"2021","unstructured":"Ma J., Luo J.: On symbol-pair weight distribution of MDS codes and simplex codes over finite fields. Cryptogr. Commun. 13(1), 101\u2013115 (2021).","journal-title":"Cryptogr. Commun."},{"key":"967_CR23","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)."},{"issue":"1","key":"967_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TIT.1973.1054936","volume":"19","author":"JL Massey","year":"1973","unstructured":"Massey J.L., Costello D.J., Justesen J.: Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19(1), 101\u2013110 (1973).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"967_CR25","doi-asserted-by":"crossref","unstructured":"Morii M., Hirotomo M., Takita M.: Error-trapping decoding for cyclic codes over symbol-pair read channels. In: Proceeding of IEEE International Symposium Information Theory (ISIT), pp. 681\u2013685 (2016)","DOI":"10.1109\/ISIT.2016.7541638"},{"issue":"4","key":"967_CR26","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(4), 643\u2013653 (2018).","journal-title":"Cryptogr. Commun."},{"issue":"12","key":"967_CR27","doi-asserted-by":"publisher","first-page":"2423","DOI":"10.1587\/transfun.E98.A.2423","volume":"98","author":"M Takita","year":"2015","unstructured":"Takita M., Hirotomo M., Morii M.: Syndrome decoding of symbol-pair codes. IEICE Trans.-A 98(12), 2423\u20132428 (2015).","journal-title":"IEICE Trans.-A"},{"key":"967_CR28","doi-asserted-by":"crossref","unstructured":"Yaakobi E., Bruck J., Siegel P. H.: Decoding of cyclic codes over symbol-pair read channels. In: Proceeding of IEEE International Symposium Information Theory (ISIT), pp. 2891\u20132895 (2012)","DOI":"10.1109\/ISIT.2012.6284053"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00967-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00967-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00967-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T07:19:20Z","timestamp":1641453560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00967-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,29]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["967"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00967-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,29]]},"assertion":[{"value":"8 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}