{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T02:54:57Z","timestamp":1777085697640,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,8,9]],"date-time":"2017-08-09T00:00:00Z","timestamp":1502236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370089"],"award-info":[{"award-number":["61370089"]}],"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":["11626077"],"award-info":[{"award-number":["11626077"]}],"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":["11501156"],"award-info":[{"award-number":["11501156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["JZ2015HGBZ0499"],"award-info":[{"award-number":["JZ2015HGBZ0499"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["JZ2016HGTA0708"],"award-info":[{"award-number":["JZ2016HGTA0708"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s12095-017-0249-2","type":"journal-article","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T23:06:53Z","timestamp":1502233613000},"page":"643-653","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["The symbol-pair distance distribution of a class of repeated-root cyclic codes over \n                \n                  \n                \n                \n                  \n                    \n                      \n                        F\n                      \n                      \n                        \n                          \n                            p\n                          \n                          \n                            m\n                          \n                        \n                      \n                    \n                  \n                \n                $\\phantom {\\dot {i}\\!}\\mathbb {F}_{p^{m}}$"],"prefix":"10.1007","volume":"10","author":[{"given":"Zhonghua","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"key":"249_CR1","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels [C]. In: Proceedings IEEE International Symposium on Information theory, Austin, TX, USA, pp 988\u2013992 (2010)","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"12","key":"249_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 [J]. IEEE Trans. Inf. Theory 57(12), 8011\u20138020 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"249_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds [C]. In: Proceedings IEEE International Symposium on Information theory, St. Petersburg, Russia, pp 2348\u20132352 (2011)","DOI":"10.1109\/ISIT.2011.6033982"},{"key":"249_CR4","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Kiah, H.M., Wang, C.: Maximum distance separable symbol-pair codes [C]. In: Proceedings of International Symposium on Information theory, Cambridge, MA, USA, pp 2886\u20132890 (2012)","DOI":"10.1109\/ISIT.2012.6284052"},{"issue":"11","key":"249_CR5","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 [J]. IEEE Trans. Inf. Theory 59(11), 7259\u20137267 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"249_CR6","unstructured":"Chen, B., Lin, L., Liu, H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions [J]. arXiv:\n                    http:\/\/arxiv.org\/abs\/1605.03460\n                    \n                   (2016)"},{"issue":"1","key":"249_CR7","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 [J]. IEEE Trans. Inf. Theory 19(1), 101\u2013110 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"249_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ffa.2007.07.001","volume":"14","author":"HQ Dinh","year":"2008","unstructured":"Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions [J]. Finite Fields Appl. 14(1), 22\u201340 (2008)","journal-title":"Finite Fields Appl."},{"issue":"11","key":"249_CR9","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 [J]. IEEE Trans. Inf. Theory 61(11), 5828\u20135834 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"249_CR10","doi-asserted-by":"crossref","unstructured":"Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels [C]. In: Proceedings of International Symposium on Information theory, Cambridge, MA, USA, pp 2891\u20132895 (2012)","DOI":"10.1109\/ISIT.2012.6284053"},{"issue":"4","key":"249_CR11","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 [J]. IEEE Trans. Inf. Theory 62(4), 1541\u20131551 (2016)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0249-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0249-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0249-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T07:31:22Z","timestamp":1583220682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0249-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,9]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0249-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,9]]},"assertion":[{"value":"7 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}