{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:26:38Z","timestamp":1755998798878,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s12095-022-00599-y","type":"journal-article","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T08:05:06Z","timestamp":1658736306000},"page":"209-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Symbol-pair weight distribution of some irreducible cyclic codes"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9709-2495","authenticated-orcid":false,"given":"Youcef","family":"Maouche","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,25]]},"reference":[{"issue":"6","key":"599_CR1","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S0019-9958(72)90354-3","volume":"20","author":"LD Baumert","year":"1972","unstructured":"Baumert, L.D., McEliece, R.J.: Weights of irreducible cyclic codes. Inf. Control 20(6), 158\u2013175 (1972)","journal-title":"Inf. Control"},{"key":"599_CR2","volume-title":"Gauss and Jacobi Sums","author":"BC Berndt","year":"1988","unstructured":"Berndt, B.C., Williams, K.S., Evans, R.J.: Gauss and Jacobi Sums. Wiley, New York (1988)"},{"key":"599_CR3","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: Algebraic constructions and asymptotic bounds. In: IEEE International Symposium on Information Theory Proceedings, pp 2348\u20132352 (2011)","DOI":"10.1109\/ISIT.2011.6033982"},{"issue":"12","key":"599_CR4","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":"599_CR5","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In: IEEE International Symposium on Information Theory Proceedings, pp 988\u2013992 (2010)","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"3","key":"599_CR6","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1109\/TIT.2008.2011511","volume":"55","author":"C Ding","year":"2009","unstructured":"Ding, C.: The weight distribution of some irreducible cyclic codes. IEEE Trans. Inform. Theory 55(3), 955\u2013960 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"599_CR7","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., Jing Y.: Hamming weights in irreducible cyclic codes. Discret. Math. 313(4), 434\u2013446 (2013)","journal-title":"Discret. Math."},{"issue":"6","key":"599_CR8","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TIT.1981.1056420","volume":"27","author":"F MacWilliams","year":"1981","unstructured":"MacWilliams, F., Seery, J.: The weight distributions of some minimal cyclic codes. IEEE Trans. Inform. Theory 27(6), 796\u2013806 (1981)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"599_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.4064\/aa-39-3-251-264","volume":"39","author":"G Myerson","year":"1981","unstructured":"Myerson, G.: Period polynomials and Gauss sums for finite fields. Acta Arithmetica 39(3), 251\u2013264 (1981)","journal-title":"Acta Arithmetica"},{"issue":"6","key":"599_CR10","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. Inf. Theory 67(6), 3735\u20133751 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"599_CR11","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. Inf. Theory 67(6), 3735\u20133751 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"599_CR12","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"},{"issue":"5","key":"599_CR13","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1007\/s10623-022-01030-6","volume":"90","author":"H Zhu","year":"2021","unstructured":"Zhu, H., Shi, M., \u00d6zbudak, F.: Complete b-symbol weight distribution of some irreducible cyclic codes. Des. Codes Cryptogr. 90(5), 1113\u20131125 (2021)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00599-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00599-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00599-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T08:22:07Z","timestamp":1674807727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00599-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,25]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["599"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00599-y","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2022,7,25]]},"assertion":[{"value":"4 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}