{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T01:42:36Z","timestamp":1768700556266,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"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":["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":["11871025"],"award-info":[{"award-number":["11871025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"self-determined research funds of CCNU from the colleges\u2019 basic research and operation of MOE","award":["CCNU18TS028"],"award-info":[{"award-number":["CCNU18TS028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s12095-020-00455-x","type":"journal-article","created":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T15:04:17Z","timestamp":1601564657000},"page":"101-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On symbol-pair weight distribution of MDS codes and simplex codes over finite fields"],"prefix":"10.1007","volume":"13","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":[[2020,10,1]]},"reference":[{"key":"455_CR1","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 988\u2013992 (2010)","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"12","key":"455_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":"455_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: Algebraic constructions and asymptotic bounds. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 2348\u20132352 (2011)","DOI":"10.1109\/ISIT.2011.6033982"},{"issue":"11","key":"455_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":"455_CR5","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Kiah, H.M., Wang, C.: Maximum distance separable symbol-pair codes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 2886\u20132890 (2012)","DOI":"10.1109\/ISIT.2012.6284052"},{"issue":"12","key":"455_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"},{"issue":"4","key":"455_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(4), 841\u2013859 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"455_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."},{"key":"455_CR9","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 constacylic codes of prime power lengths over pm + upm. IEEE Access 7, 145039\u2013145048 (2019)","journal-title":"IEEE Access"},{"issue":"12","key":"455_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 distance of repeated-root constacyclic codes of prime power lengths over $\\mathbb {F}_{p^{m}}+u\\mathbb {F}_{p^{m}}$. IEEE Commun. Letters 22(12), 2400\u20132403 (2018)","journal-title":"IEEE Commun. Letters"},{"issue":"4","key":"455_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":"1","key":"455_CR12","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 2ps, over pm. IEEE Trans. Inf. Theory 66(1), 240\u2013262 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"455_CR13","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 2ps. Discrete Math. 342(11), 3062\u20133078 (2019)","journal-title":"Discrete Math."},{"issue":"3","key":"455_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":"455_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: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 1944\u20131948 (2016)","DOI":"10.1109\/ISIT.2016.7541638"},{"key":"455_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 Univ. Press, Cambridge (2003)"},{"issue":"11","key":"455_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":"455_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. Letters 22(3), 462\u2013465 (2018)","journal-title":"IEEE Commun. Letters"},{"issue":"3","key":"455_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":"455_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":"455_CR21","doi-asserted-by":"crossref","unstructured":"Morii, M., Hirotomo, M., Takita, M.: Error-trapping decoding for cyclic codes over symbol-pair read channels. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 681\u2013685 (2016)","DOI":"10.1109\/ISIT.2016.7541638"},{"issue":"12","key":"455_CR22","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 Transactions-A 98(12), 2423\u20132428 (2015)","journal-title":"IEICE Transactions-A"},{"issue":"4","key":"455_CR23","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"},{"key":"455_CR24","doi-asserted-by":"crossref","unstructured":"Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 2891\u20132895 (2012)","DOI":"10.1109\/ISIT.2012.6284053"},{"key":"455_CR25","unstructured":"Yang, M., Li, J., Feng, K.: Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound. arXiv:1607.02677"},{"issue":"4","key":"455_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."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-020-00455-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-020-00455-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-020-00455-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T01:00:31Z","timestamp":1633050031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-020-00455-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["455"],"URL":"https:\/\/doi.org\/10.1007\/s12095-020-00455-x","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,1]]},"assertion":[{"value":"26 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}