{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:38:52Z","timestamp":1768685932824,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"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":["12071001"],"award-info":[{"award-number":["12071001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005063","name":"Excellent Young Talents Fund Program of Higher Education Institutions of Anhui Province","doi-asserted-by":"crossref","award":["1808085J20"],"award-info":[{"award-number":["1808085J20"]}],"id":[{"id":"10.13039\/501100005063","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10623-022-01030-6","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T12:03:48Z","timestamp":1647864228000},"page":"1113-1125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Complete b-symbol weight distribution of some irreducible cyclic codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Hongwei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minjia","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferruh","family":"\u00d6zbudak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"key":"1030_CR1","doi-asserted-by":"crossref","unstructured":"Cassuto Y., Blaum M.: Codes for symbol-pair read channels. In: Proc Int. Symp. Inf. Theory, pp. 988\u2013992. Austin, TX, USA, Jun (2010).","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"12","key":"1030_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. Inform. Theory 57(12), 8011\u20138020 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1030_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proc. Int. Symp. Inf. Theory, St. Petersburg, Russia, pp. 2348\u20132352, Jul\/Aug (2011).","DOI":"10.1109\/ISIT.2011.6033982"},{"issue":"11","key":"1030_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. Inform. Theory 59(11), 7259\u20137267 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1030_CR5","doi-asserted-by":"crossref","unstructured":"Chee Y.M., Kiah H.M., Wang C., Yin J.: Maximum distance separable symbol-pair codes. In: Proc IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, pp. 2886\u20132890 (2012).","DOI":"10.1109\/ISIT.2012.6284052"},{"issue":"12","key":"1030_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. Inform. Theory 63(12), 7661\u20137666 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1030_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":"1030_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":"1030_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.disc.2012.11.009","volume":"313","author":"C Ding","year":"2013","unstructured":"Ding C., Yang J.: Hamming weights in irreducible cyclic codes. Discret. Math. 313(4), 434\u2013446 (2013).","journal-title":"Discret. Math."},{"issue":"11","key":"1030_CR10","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. Inform. Theory 61(11), 5828\u20135834 (2015).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1030_CR11","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Finite Fields, Second Edition","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields, Second Edition, vol. 20. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997)."},{"issue":"1","key":"1030_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/ffta.2000.0293","volume":"8","author":"B Schmidt","year":"2002","unstructured":"Schmidt B., White C.: All two-weight irreducible cyclic codes? Finite Fields Appl. 8(1), 1\u201317 (2002).","journal-title":"Finite Fields Appl."},{"issue":"3","key":"1030_CR13","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1109\/TIT.2019.2946660","volume":"67","author":"M Shi","year":"2020","unstructured":"Shi M., Li X., Neri A., Sol\u00e9 P.: How many weights can a cyclic code have? IEEE Trans. Inform. Theory 67(3), 1449\u20131459 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"1030_CR14","doi-asserted-by":"publisher","first-page":"6855","DOI":"10.1109\/TIT.2020.3001591","volume":"67","author":"M Shi","year":"2020","unstructured":"Shi M., Neri A., Sol\u00e9 P.: How many weights can a quasi-cyclic code have? IEEE Trans. Inform. Theory 67(11), 6855\u20136862 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1030_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-018-0488-z","volume":"8","author":"M Shi","year":"2019","unstructured":"Shi M., Zhu H., Sol\u00e9 P., Cohen G.: How many weights can a linear code have? Des. Codes Cryptogr. 8(1), 87\u201395 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1030_CR16","doi-asserted-by":"publisher","first-page":"3735","DOI":"10.1109\/TIT.2021.3069772","volume":"67","author":"M Shi","year":"2021","unstructured":"Shi M., \u00d6zbudak F., Sol\u00e9 P.: Geometric approach to $$b$$-symbol hamming weights of cyclic codes. IEEE Trans. Inform. Theory 67(6), 3735\u20133751 (2021).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1030_CR17","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":"4","key":"1030_CR18","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. Inform. Theory 62(4), 1541\u20131551 (2016).","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01030-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01030-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01030-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T19:10:15Z","timestamp":1650913815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01030-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1030"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01030-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"6 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}