{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T13:14:58Z","timestamp":1777295698504,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"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":["12171420"],"award-info":[{"award-number":["12171420"]}],"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":["12441103"],"award-info":[{"award-number":["12441103"]}],"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":[[2026,4]]},"DOI":"10.1007\/s10623-025-01797-4","type":"journal-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:23:49Z","timestamp":1775719429000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quasi-cyclic binary extended and expurgated Goppa codes and their parameters"],"prefix":"10.1007","volume":"94","author":[{"given":"Fengwei","family":"Li","sequence":"first","affiliation":[]},{"given":"Xue","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,9]]},"reference":[{"issue":"3","key":"1797_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/ffta.2000.0277","volume":"6","author":"TP Berger","year":"2000","unstructured":"Berger T.P.: 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."},{"issue":"7","key":"1797_CR2","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1109\/18.887871","volume":"46","author":"TP Berger","year":"2000","unstructured":"Berger T.P.: Goppa and related codes invariant under a prescribed permutation. IEEE Trans. Inform. Theory 46(7), 2628\u20132633 (2000).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1797_CR3","doi-asserted-by":"crossref","unstructured":"Berger, T. P., Cayrel, P. L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem, in Proc. 2nd Int. Conf. Cryptol., Gammarth, Tunisia, 77-97,(2009)","DOI":"10.1007\/978-3-642-02384-2_6"},{"issue":"3","key":"1797_CR4","first-page":"98","volume":"25","author":"SV Bezzateev","year":"1989","unstructured":"Bezzateev S.V., Mironchikov E.T., Shekhunova N.A.: A subclass of binary Goppa code. Probl. Peredachi Inform. 25(3), 98\u2013102 (1989).","journal-title":"Probl. Peredachi Inform."},{"issue":"12","key":"1797_CR5","doi-asserted-by":"publisher","first-page":"5773","DOI":"10.1109\/TIT.2008.2006442","volume":"54","author":"SV Bezzateev","year":"2008","unstructured":"Bezzateev S.V., Shekhunova N.A.: Chain of separable binary Goppa codes and their minimal distance. IEEE Trans. Inform. Theory 54(12), 5773\u20135778 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1797_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1008252303768","volume":"14","author":"SV Bezzateev","year":"1998","unstructured":"Bezzateev S.V., Shekhunova N.A.: A subclass of binary Goppa codes with improved estimation of the code dimension. Design, Codes and Cryptography 14(1), 23\u201338 (1998).","journal-title":"Design, Codes and Cryptography"},{"issue":"8","key":"1797_CR7","doi-asserted-by":"publisher","first-page":"5145","DOI":"10.1109\/TIT.2022.3166847","volume":"68","author":"B Chen","year":"2022","unstructured":"Chen B., Zhang G.: Enumeration of extended irreducible binary Goppa codes. IEEE Trans. Inform. Theory 68(8), 5145\u20135153 (2022).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1797_CR8","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of International Workshop on Coding Cryptography (WCC). Bergen, Norway, pp.\u00a081-91 (2005)"},{"issue":"3","key":"1797_CR9","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa V.D.: A new class of linear correcting codes. Probl. Pereda. Inform. 6(3), 24\u201330 (1970).","journal-title":"Probl. Pereda. Inform."},{"key":"1797_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error Correcting codes","author":"W Huffman","year":"2003","unstructured":"Huffman W., Pless V.: Fundamentals of Error Correcting codes. Cambridge University Press, Cambridge (2003)."},{"key":"1797_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s12095-023-00629-3","volume":"15","author":"D Huang","year":"2023","unstructured":"Huang D., Yue Q., Li F.: Two classes of quasi-cyclic codes via irreducible polynomials. Cryptogr. Commun. 15, 649\u2013659 (2023).","journal-title":"Cryptogr. Commun."},{"key":"1797_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11167-3","volume-title":"Applied Finite Group Actions","author":"A Kerber","year":"1999","unstructured":"Kerber A.: Applied Finite Group Actions. Springer, New York (1999)."},{"issue":"7","key":"1797_CR13","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1007\/s10623-022-01062-y","volume":"90","author":"X Li","year":"2022","unstructured":"Li X., Yue Q.: Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes. Des. Codes Cryptogr. 90(7), 1629\u20131647 (2022).","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"1797_CR14","doi-asserted-by":"publisher","first-page":"6472","DOI":"10.1109\/TIT.2022.3178110","volume":"68","author":"X Li","year":"2022","unstructured":"Li X., Yue Q.: Construction of expurgated and extended Goppa codes with dihedral automorphism groups. IEEE Trans. Inform. Theory 68(10), 6472\u20136480 (2022).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1797_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12095-023-00675-x","volume":"16","author":"X Li","year":"2024","unstructured":"Li X., Yue Q., Huang D.: Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory. Cryptogr. Commun. 16, 185\u2013207 (2024).","journal-title":"Cryptogr. Commun."},{"key":"1797_CR16","first-page":"114","volume":"42\u201344","author":"R McEliece","year":"1978","unstructured":"McEliece R.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42\u201344, 114\u2013116 (1978).","journal-title":"DSN Prog. Rep."},{"key":"1797_CR17","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.: Compact McEliece keys from Goppa codes. In: Proceedings of 16th Annual International Workshop on Selected Areas in Cryptography (SAC), Calgary, AB, Canada, pp.\u00a0376\u2013392 (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"1797_CR18","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North Holland, New York (1977)."},{"issue":"2","key":"1797_CR19","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type crypto systems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986).","journal-title":"Probl. Control Inf. Theory"},{"issue":"2","key":"1797_CR20","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."},{"issue":"3","key":"1797_CR21","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/18.135654","volume":"38","author":"AM Roseiro","year":"1992","unstructured":"Roseiro A.M., Hall J.I., Hadney J.E., Siegel M.: The trace operator and redundancy of Goppa codes. IEEE Trans. Inform. Theory 38(3), 1130\u20131133 (1992).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1797_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"RM Roth","year":"2006","unstructured":"Roth R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)."},{"key":"1797_CR23","doi-asserted-by":"crossref","unstructured":"V$$ \\acute{e}$$ron, P.: Goppa codes and trace operator. IEEE Trans. Inform. Theory 44(1), 290\u2013295 (1998)","DOI":"10.1109\/18.651048"},{"key":"1797_CR24","doi-asserted-by":"crossref","unstructured":"V$$ \\acute{e}$$ron.: True dimension of some binary quadratic trace Goppa codes. Des. Codes Cryptogr. 24(1), 81\u201397 (2001)","DOI":"10.1023\/A:1011281431366"},{"key":"1797_CR25","doi-asserted-by":"crossref","unstructured":"V$$ \\acute{e}$$ron, P.: oof of conjectures on the true dimension of some binary Goppa codes. Des. Codes Cryptogr. 36(3), 317\u2013325 (2005)","DOI":"10.1007\/s10623-004-1722-4"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01797-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01797-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01797-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T12:15:38Z","timestamp":1777292138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01797-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1797"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01797-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"18 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"85"}}