{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T12:37:17Z","timestamp":1742647037818,"version":"3.40.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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":["62032009"],"award-info":[{"award-number":["62032009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s12095-024-00765-4","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T06:49:47Z","timestamp":1733726987000},"page":"421-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Goppa type sum-rank codes"],"prefix":"10.1007","volume":"17","author":[{"given":"Yaqi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"765_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Selected Areas in Cryptography. pp. 143-158 (2010)","DOI":"10.1007\/978-3-642-19574-7_10"},{"key":"765_CR2","unstructured":"Bezzateev, S., Shekhunova, N.: Cumulative-separable codes (2010). arXiv:1005.1524"},{"issue":"1","key":"765_CR3","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 Goppa polynomials and matched location sets. Cryptogr. Commun. 9(1), 23\u201339 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"11","key":"765_CR4","doi-asserted-by":"publisher","first-page":"7379","DOI":"10.1109\/TIT.2013.2278176","volume":"59","author":"S Bezzateev","year":"2013","unstructured":"Bezzateev, S., Shekhunova, N.: Subclass of cyclic Goppa codes. IEEE Trans. Inform. Theory. 59(11), 7379\u20137385 (2013)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"765_CR5","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10623-018-0566-2","volume":"87","author":"S Bezzateev","year":"2019","unstructured":"Bezzateev, S., Shekhunova, N.: Totally decomposed cumulative Goppa codes with improved estimations. Des. Codes Cryptogr. 87, 569\u2013587 (2019)","journal-title":"Des. Codes Cryptogr."},{"key":"765_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symbolic Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"10","key":"765_CR7","doi-asserted-by":"publisher","first-page":"6456","DOI":"10.1109\/TIT.2021.3074190","volume":"67","author":"E Byrne","year":"2021","unstructured":"Byrne, E., Gluesing-Luerssen, H., Ravagnani, A.: Fundamental properties of sum-rank-metric codes. IEEE Trans. Inf. Theory 67(10), 6456\u20136475 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"765_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., Ding, C., Cheng Z., Xie, C.: Cyclic and negacyclic sum-rank codes (2024). arXiv:2401.04885","DOI":"10.1007\/s12095-024-00765-4"},{"issue":"10","key":"765_CR9","doi-asserted-by":"publisher","first-page":"6303","DOI":"10.1109\/TIT.2023.3292162","volume":"69","author":"H Chen","year":"2023","unstructured":"Chen, H.: New explicit linear sum-rank-metric codes. IEEE Trans. Inf. Theory 69(10), 6303\u20136313 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"765_CR10","first-page":"4","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear correcting codes. Probl. Peredachi Informatsii 6(3), 4\u201330 (1970)","journal-title":"Probl. Peredachi Informatsii"},{"key":"765_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ffa.2014.04.007","volume":"29","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Otmani, A., Tillich, J.P.: New ideneties relating wild Goppa codes. Finite Fields Appl. 29, 178\u2013197 (2014)","journal-title":"Finite Fields Appl."},{"key":"765_CR12","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Available online at: http:\/\/www.codetables.de Accessed 21 July 2024"},{"issue":"9","key":"765_CR13","doi-asserted-by":"publisher","first-page":"5296","DOI":"10.1109\/TIT.2014.2330814","volume":"60","author":"M Jibril","year":"2014","unstructured":"Jibril, M., Bezzateev, S.V., Tomlinson, M., Grassl, M., Ahmed, M.Z.: A generalized construction of extended Goppa codes. IEEE Trans. Inf. Theory 60(9), 5296\u20135303 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"765_CR14","unstructured":"Lao H., Cheng, Z. Available online at: http:\/\/jnu-coding-crypts-organization.gitbook.io\/sum-rank-metric-codes\/ Accessed 21 July 2024"},{"key":"765_CR15","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key system based algebraic coding theory. Deep Space Network Progress Report 44, 114\u2013116 (1978)","journal-title":"Deep Space Network Progress Report"},{"key":"765_CR16","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.jalgebra.2018.02.005","volume":"504","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring. J. Algebra 504, 587\u2013612 (2018)","journal-title":"J. Algebra"},{"issue":"8","key":"765_CR17","doi-asserted-by":"publisher","first-page":"5149","DOI":"10.1109\/TIT.2021.3088712","volume":"67","author":"U Mart\u00ednez-Pe\u00f1as","year":"2021","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Sum-rank BCH codes and cyclic-skew-cyclic codes. IEEE Trans. Inf. Theory 67(8), 5149\u20135167 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"765_CR18","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/TIT.2019.2912165","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Reliable and secure multishot network coding using linearized Reed-Solomon codes. IEEE Trans. Inf. Theory 65(8), 4785\u20134803 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"765_CR19","doi-asserted-by":"publisher","first-page":"7790","DOI":"10.1109\/TIT.2019.2924888","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Universal and dynamic locally repairable codes with maximally recoverablity via sum-rank codes. IEEE Trans. Inf. Theory 65(12), 7790\u20137805 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"765_CR20","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/j.jalgebra.2022.06.027","volume":"609","author":"A Neri","year":"2022","unstructured":"Neri, A.: Twisted linearized Reed-Solomon codes: A skew polynomial framework. J. Algebra 609, 792\u2013839 (2022)","journal-title":"J. Algebra"},{"key":"765_CR21","doi-asserted-by":"crossref","unstructured":"Nobrega, R. W., Uchoa-Filho, B. F.: Multishot codes for network coding using rank-metric codes. Proc. 3rd IEEE Int. Workshop Wireless Netw. Coding. pp. 1\u201314 (2010)","DOI":"10.1109\/WINC.2010.5507933"},{"issue":"3","key":"765_CR22","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1109\/TIT.2021.3129767","volume":"68","author":"M Shehadeh","year":"2022","unstructured":"Shehadeh, M., Kschischang, F.R.: Space-time codes from sum-rank codes. IEEE Trans. Inf. Theory 68(3), 1614\u20131637 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"765_CR23","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TIT.1972.1054833","volume":"18","author":"N Sloane","year":"1972","unstructured":"Sloane, N., Reddy, S., Chen, C.L.: New binary codes. IEEE Trans. Inf. Theory 18(4), 503\u2013510 (1972)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00765-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00765-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00765-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:01:20Z","timestamp":1742587280000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00765-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["765"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00765-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"23 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2024","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}