{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T02:54:55Z","timestamp":1777085695857,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"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":["12171420"],"award-info":[{"award-number":["12171420"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021MA046"],"award-info":[{"award-number":["ZR2021MA046"]}],"id":[{"id":"10.13039\/501100007129","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":[[2023,5]]},"DOI":"10.1007\/s10623-023-01184-x","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T16:04:10Z","timestamp":1673971450000},"page":"1873-1888","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Cyclic codes of length 5p with MDS symbol-pair"],"prefix":"10.1007","volume":"91","author":[{"given":"Fengwei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,17]]},"reference":[{"issue":"12","key":"1184_CR1","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"},{"issue":"2","key":"1184_CR2","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":"1184_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto Y., Litsyn S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proceedings of the IEEE International Symposium on Information Theory, Saint Petersburg, Russia, pp. 2348\u20132352 (2011)","DOI":"10.1109\/ISIT.2011.6033982"},{"issue":"11","key":"1184_CR4","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"},{"key":"1184_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":"12","key":"1184_CR6","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"},{"key":"1184_CR7","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, 841\u2013859 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1184_CR8","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, 180\u2013197 (2018).","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1184_CR9","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":"1184_CR10","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 distance of repeated-root constacyclic codes of length $$2p^s$$. Discret. Math. 342(11), 3062\u20133078 (2019).","journal-title":"Discret. Math."},{"issue":"4","key":"1184_CR11","doi-asserted-by":"publisher","first-page":"111780","DOI":"10.1016\/j.disc.2019.111780","volume":"343","author":"HQ Dinh","year":"2020","unstructured":"Dinh H.Q., Wang X., Liu H., Sriboonchitta S.: On the $$b$$-distance of repeated-root constacyclic codes of prime power lengths. Discret. Math. 343(4), 111780 (2020).","journal-title":"Discret. Math."},{"issue":"11","key":"1184_CR12","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":"1184_CR13","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":"1184_CR14","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":"1184_CR15","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."},{"issue":"4","key":"1184_CR16","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"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01184-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01184-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01184-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:08:41Z","timestamp":1682021321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01184-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,17]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1184"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01184-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,17]]},"assertion":[{"value":"8 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}