{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:38Z","timestamp":1771611038679,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031296888","type":"print"},{"value":"9783031296895","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29689-5_6","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:04:08Z","timestamp":1680019448000},"page":"90-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Decoding High-Order Interleaved Sum-Rank-Metric Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7538-7639","authenticated-orcid":false,"given":"Thomas","family":"Jerkovits","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2217-9753","authenticated-orcid":false,"given":"Felicitas","family":"H\u00f6rmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7767-1513","authenticated-orcid":false,"given":"Hannes","family":"Bartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process (2022)","DOI":"10.6028\/NIST.IR.8413"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bartz, H., Puchinger, S.: Fast decoding of interleaved linearized Reed-Solomon codes and variants. IEEE Trans. Inf. Theory. arXiv preprint arXiv:2201.01339 (2022)","DOI":"10.1109\/ISIT45174.2021.9517834"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2008.07.004","volume":"15","author":"JM Couveignes","year":"2009","unstructured":"Couveignes, J.M., Lercier, R.: Elliptic periods for finite fields. Finite Fields Appl. 15(1), 1\u201322 (2009). https:\/\/doi.org\/10.1016\/j.ffa.2008.07.004","journal-title":"Finite Fields Appl."},{"key":"6_CR4","unstructured":"Elleuch, M., Wachter-Zeh, A., Zeh, A.: A public-key cryptosystem from interleaved Goppa codes. arXiv preprint arXiv:1809.03024 (2018)"},{"issue":"7","key":"6_CR5","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1109\/18.796374","volume":"45","author":"C Haslach","year":"1999","unstructured":"Haslach, C., Vinck, A.H.: A decoding algorithm with restrictions for array codes. IEEE Trans. Inf. Theory 45(7), 2339\u20132344 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Haslach, C., Vinck, A.H.: Efficient decoding of interleaved linear block codes. In: 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060), p. 149. IEEE (2000)","DOI":"10.1109\/ISIT.2000.866441"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Holzbaur, L., Liu, H., Puchinger, S., Wachter-Zeh, A.: On decoding and applications of interleaved Goppa codes. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 1887\u20131891 (2019)","DOI":"10.1109\/ISIT.2019.8849600"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"2740","DOI":"10.1109\/20.617715","volume":"33","author":"VY Krachkovsky","year":"1997","unstructured":"Krachkovsky, V.Y., Lee, Y.X.: Decoding for iterative Reed-Solomon coding schemes. IEEE Trans. Magn. 33(5), 2740\u20132742 (1997)","journal-title":"IEEE Trans. Magn."},{"key":"6_CR9","unstructured":"Loidreau, P., Overbeck, R.: Decoding rank errors beyond the error correcting capability. In: International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), pp. 186\u2013190 (2006)"},{"key":"6_CR10","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"},{"key":"6_CR11","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Coding THV 4244, 114\u2013116 (1978)","journal-title":"Coding THV"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Metzner, J.J.: Vector symbol decoding with erasures, errors and symbol list decisions. In: Proceedings IEEE International Symposium on Information Theory, p. 34. IEEE (2002)","DOI":"10.1109\/ISIT.2002.1023306"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TCOMM.2003.809758","volume":"51","author":"JJ Metzner","year":"2003","unstructured":"Metzner, J.J.: Vector symbol decoding with list inner symbol decisions. IEEE Trans. Commun. 51(3), 371\u2013380 (2003)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/18.53757","volume":"36","author":"JJ Metzner","year":"1990","unstructured":"Metzner, J.J., Kapturowski, E.J.: A general decoding technique applicable to replicated file disagreement location and concatenated code decoding. IEEE Trans. Inf. Theory 36(4), 911\u2013917 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/18.272474","volume":"40","author":"KT Oh","year":"1994","unstructured":"Oh, K.T., Metzner, J.J.: Performance of a general decoding technique over the class of randomly chosen parity check codes. IEEE Trans. Inf. Theory 40(1), 160\u2013166 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Porwal, A., Holzbaur, L., Liu, H., Renner, J., Wachter-Zeh, A., Weger, V.: Interleaved Prange: a new generic decoder for interleaved codes. In: Cheon, J.H., Johansson, T. (eds.) Post-Quantum Cryptography (PQCrypto 2022). LNCS, vol. 13512, pp. 69\u201388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_4","DOI":"10.1007\/978-3-031-17234-2_4"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Puchinger, S., Renner, J., Rosenkilde, J.: Generic decoding in the sum-rank metric. In: 2020 IEEE International Symposium on Information Theory (ISIT), pp. 54\u201359. IEEE (2020)","DOI":"10.1109\/ISIT44484.2020.9174497"},{"key":"6_CR18","unstructured":"Puchinger, S., Renner, J., Wachter-Zeh, A.: Decoding high-order interleaved rank-metric codes. arXiv preprint arXiv:1904.08774 (2019)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: Interleaving Loidreau\u2019s rank-metric cryptosystem. In: 2019 XVI International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d (REDUNDANCY), pp. 127\u2013132. IEEE (2019)","DOI":"10.1109\/REDUNDANCY48165.2019.9003318"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: Decoding high-order interleaved rank-metric codes. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 19\u201324. IEEE (2021)","DOI":"10.1109\/ISIT45174.2021.9518085"},{"issue":"5","key":"6_CR21","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1109\/TIT.2014.2310479","volume":"60","author":"RM Roth","year":"2014","unstructured":"Roth, R.M., Vontobel, P.O.: Coding for combined block-symbol error correction. IEEE Trans. Inf. Theory 60(5), 2697\u20132713 (2014)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29689-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T06:14:16Z","timestamp":1729145656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29689-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031296888","9783031296895"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29689-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}