{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:50:56Z","timestamp":1775757056999,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T00:00:00Z","timestamp":1676332800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T00:00:00Z","timestamp":1676332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172219"],"award-info":[{"award-number":["62172219"]}],"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":["12171420"],"award-info":[{"award-number":["12171420"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021MA046"],"award-info":[{"award-number":["ZR2021MA046"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s12095-023-00629-3","type":"journal-article","created":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T11:07:24Z","timestamp":1676372844000},"page":"649-659","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two classes of quasi-cyclic codes via irreducible polynomials"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1150-5843","authenticated-orcid":false,"given":"Daitao","family":"Huang","sequence":"first","affiliation":[]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Fengwei","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,14]]},"reference":[{"key":"629_CR1","doi-asserted-by":"crossref","unstructured":"Barreto, P., lindner, R., Misoczki, R.: Monoidic codes in cryptography. In: Yang, B. Y. (ed.) Post-Quantum Cryptography (Leture Notes in Computer Science), vol. 7071, pp 179\u2013199. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25405-5_12"},{"key":"629_CR2","doi-asserted-by":"crossref","unstructured":"Berger, T.: Cyclic alternant codes induced by an automorphism of a GRS code. In: Mullin, R, Mullen, G (eds.) Finite Field: Theory, Applications and Algorithms. Contemporary Mathematics 225, pp 143\u2013154. American Mathematical Society, Providence (1999)","DOI":"10.1090\/conm\/225\/03216"},{"issue":"4","key":"629_CR3","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1109\/18.761281","volume":"45","author":"T Berger","year":"1999","unstructured":"Berger, T.: New classes of cyclic extended Goppa cods. IEEE Trans. Inf. Theory 45(4), 1264\u20131266 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"629_CR4","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1109\/18.887871","volume":"46","author":"T Berger","year":"2000","unstructured":"Berger, T.: Goppa and related codes invariant under a prescribed permutation. IEEE Trans. Inf. Theory 46(7), 2628\u20132633 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"629_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/ffta.2000.0277","volume":"6","author":"T Berger","year":"2000","unstructured":"Berger, T.: On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes. Finite Fields Appl. 6(3), 255\u2013281 (2000)","journal-title":"Finite Fields Appl."},{"key":"629_CR6","unstructured":"Berger, T.: Quasi-cyclic Goppa codes. In: Proceedings of IEEE International Symposium on Information Theory (2000)"},{"key":"629_CR7","doi-asserted-by":"crossref","unstructured":"Berger, T., Cayrel, P. L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece Cryptosystm. In: Proceedings of the 2nd International Conference on Cryptology (AFRICACRYPT), Gammarth, Tunisia, pp 77\u201397 (2009)","DOI":"10.1007\/978-3-642-02384-2_6"},{"issue":"1","key":"629_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s12095-016-0196-3","volume":"9","author":"S Bezzateev","year":"2017","unstructured":"Bezzateev, S., Shekhunova, N.: Quasi-cyclic Goppa codes with special polynomials and matched location sets. Cryptogr. Commun. 9(1), 23\u201339 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"1","key":"629_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10623-010-9417-5","volume":"60","author":"Y Cao","year":"2011","unstructured":"Cao, Y.: Structural properties and enumeration of 1-generator generalized quasi-cyclic codes. Des. Codes. Cryptogr. 60(1), 67\u201379 (2011)","journal-title":"Des. Codes. Cryptogr."},{"issue":"3","key":"629_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00200-011-0145-5","volume":"22","author":"Y Cao","year":"2011","unstructured":"Cao, Y.: Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration. Appl. Algebra Eng. Commun. Comput. 22(3), 219\u2013233 (2011)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"6","key":"629_CR11","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TIT.1978.1055951","volume":"24","author":"C Chen","year":"1978","unstructured":"Chen, C.: Equivalent irreducible Goppa codes(corresp.) IEEE Trans. Inf. Theory 24(6), 766\u2013769 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"629_CR12","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/TIT.2015.2493539","volume":"62","author":"J Faug\u00e8re","year":"2016","unstructured":"Faug\u00e8re, J., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.P.: Folding Alternant and Goppa codes with non-trivial automorphism groups. IEEE Trans. Inf. Theory 62(1), 184\u2013198 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"629_CR13","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of International Workshop on Coding Cryptography (WCC), Bergen, Norway, pp 81\u201391 (2005)"},{"issue":"3","key":"629_CR14","first-page":"24","volume":"6","author":"V Goppa","year":"1970","unstructured":"Goppa, V.: A new class of linear correcting codes. Probl. Pereda. Inf. 6(3), 24\u201330 (1970)","journal-title":"Probl. Pereda. Inf."},{"issue":"3","key":"629_CR15","first-page":"41","volume":"7","author":"V Goppa","year":"1971","unstructured":"Goppa, V.: Rational representation of codes and (L,g) codes. Probl. Predach. Inform. 7(3), 41\u201349 (1971)","journal-title":"Probl. Predach. Inform."},{"issue":"1","key":"629_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TIT.2021.3116659","volume":"68","author":"D Huang","year":"2022","unstructured":"Huang, D., Yue, Q.: Extended irreducible binary sextic Goppa codes. IEEE Trans. Inf. Theory 68(1), 230\u2013237 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"629_CR17","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.1974.1055262","volume":"20","author":"T Kasami","year":"1974","unstructured":"Kasami, T.: A Gilbert-Varshamov bound for quasi-cyclic codes of rate $\\frac {1}{2}$. IEEE Trans. Inform. Theory 20(5), 679 (1974)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"629_CR18","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling, S., Sol\u00e9, P.: On the algebraic structure of quasi-cyclic codes i: finite fields. IEEE Trans. Inf. Theory 47(7), 2751\u20132760 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"629_CR19","unstructured":"Macwilliams, F., Sloane, N.: The Theory of Error Correcting Codes. North-Holland (1986)"},{"key":"629_CR20","first-page":"114","volume":"42\u201344","author":"R McEliece","year":"1978","unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report 42\u201344, 114\u2013116 (1978)","journal-title":"DSN Progress Report"},{"key":"629_CR21","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.: Compact McEliece keys from Goppa Cods. In: Proceedings of the 16th Annual International Workshop in Selected Areas in Cryptography (SAC), Caygary, AB, Canada, pp 376\u2013392 (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"issue":"2","key":"629_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J., Dallot, L.: Cryptanalysis of two mceliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3(2), 129\u2013140 (2010)","journal-title":"Math. Comput. Sci."},{"issue":"2","key":"629_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/jmc-2011-0099","volume":"6","author":"E Persichetti","year":"2012","unstructured":"Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava codes. J. Math. Cryptol. 6(2), 149\u2013169 (2012)","journal-title":"J. Math. Cryptol."},{"key":"629_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ffa.2016.01.010","volume":"39","author":"M Shi","year":"2016","unstructured":"Shi, M., Zhang, Y.: Quasi-twisted codes with constacyclic constituent codes. Finite Fields Appl. 39, 159\u2013178 (2016)","journal-title":"Finite Fields Appl."},{"issue":"11","key":"629_CR25","doi-asserted-by":"publisher","first-page":"2485","DOI":"10.1007\/s10623-017-0455-0","volume":"86","author":"M Shi","year":"2018","unstructured":"Shi, M., Qian, L., Sol\u00e9, P.: On self-dual negacirculant codes of index two and four. Des. Codes Cryptogr. 86(11), 2485\u20132484 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"629_CR26","doi-asserted-by":"publisher","first-page":"6855","DOI":"10.1109\/TIT.2020.3001591","volume":"66","author":"M Shi","year":"2020","unstructured":"Shi, M., Neri, A., Sol\u00e9, P.: How many weights can a quasi-cyclic code have. IEEE Trans. Inf. Theory 66(11), 6855\u20136862 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"629_CR27","doi-asserted-by":"publisher","first-page":"7232","DOI":"10.1109\/TIT.2021.3111858","volume":"67","author":"M Shi","year":"2021","unstructured":"Shi, M., Li, S., Sol\u00e9, P.: $\\mathbb {Z}_{2}\\mathbb {Z}_{4}$-additive quasi-cyclic codes. IEEE Trans. Inf. Theory 67(11), 7232\u20137239 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"629_CR28","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/18.850694","volume":"46","author":"I Siap","year":"2000","unstructured":"Siap, I., Aydin, N., Ray-chaudhuri, D.: New ternary quasi-cyclic codes with better minimum distances. IEEE Trans. Inf. Theory 46(4), 1554\u20131558 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"629_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s12095-015-0175-0","volume":"9","author":"T Wu","year":"2017","unstructured":"Wu, T., Gao, J.: 1-generator generalized quasi-cyclic codes over $\\mathbb {Z}_{4}$. Cryptogr. Commun. 9(2), 291\u2013299 (2017)","journal-title":"Cryptogr. Commun."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00629-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00629-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00629-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:08:48Z","timestamp":1680073728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00629-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,14]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["629"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00629-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,14]]},"assertion":[{"value":"31 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}