{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T02:54:54Z","timestamp":1777085694541,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T00:00:00Z","timestamp":1471564800000},"content-version":"unspecified","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":["Grant Nos. 11431003 and 61571310"],"award-info":[{"award-number":["Grant Nos. 11431003 and 61571310"]}],"id":[{"id":"10.13039\/501100001809","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":[[2017,9]]},"DOI":"10.1007\/s10623-016-0271-y","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T04:28:22Z","timestamp":1471580902000},"page":"359-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes"],"prefix":"10.1007","volume":"84","author":[{"given":"Shuxing","family":"Li","sequence":"first","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,19]]},"reference":[{"key":"271_CR1","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In: Proceedings of the International Symposium on Information Theory, pp. 988\u2013992 (2010)","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"12","key":"271_CR2","doi-asserted-by":"crossref","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":"271_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proceedings of the International Symposium on Information Theory, pp. 2348\u20132352 (2011)","DOI":"10.1109\/ISIT.2011.6033982"},{"key":"271_CR4","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Kiah, H.M., Wang, C.: Maximum distance separable symbol-pair codes. In: Proceedings of the International Symposium on Information Theory, pp. 2886\u20132890 (2012)","DOI":"10.1109\/ISIT.2012.6284052"},{"issue":"11","key":"271_CR5","doi-asserted-by":"crossref","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":"271_CR6","doi-asserted-by":"crossref","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":"271_CR7","doi-asserted-by":"crossref","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"},{"key":"271_CR8","doi-asserted-by":"crossref","unstructured":"Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. In: Proceedings of the International Symposium on Information Theory, pp. 2891\u20132895 (2012)","DOI":"10.1109\/ISIT.2012.6284053"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0271-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0271-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0271-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0271-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T04:21:25Z","timestamp":1499919685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0271-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,19]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["271"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0271-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,19]]}}}