{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:35Z","timestamp":1771611035517,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T00:00:00Z","timestamp":1539043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10623-018-0563-5","type":"journal-article","created":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T03:56:26Z","timestamp":1539057386000},"page":"547-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved syndrome decoding of lifted \n                \n                  \n                \n                $$L$$\n                \n                  \n                    L\n                  \n                \n              -interleaved Gabidulin codes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7767-1513","authenticated-orcid":false,"given":"Hannes","family":"Bartz","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Sidorenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,9]]},"reference":[{"issue":"4","key":"563_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S., Yeung R.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"563_CR2","unstructured":"Bartz H.: Algebraic decoding of subspace and rank-metric codes. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2017)"},{"key":"563_CR3","unstructured":"Bartz H., Meier M., Sidorenko V.: Improved syndrome decoding of interleaved subspace codes. In: 11th International ITG Conference on Systems, Communication and Coding 2017 (SCC), Hamburg, Germany (2017)."},{"issue":"4","key":"563_CR4","doi-asserted-by":"publisher","first-page":"773","DOI":"10.3934\/amc.2018046","volume":"12","author":"H Bartz","year":"2018","unstructured":"Bartz H., Wachter-Zeh A.: Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gr\u00f6bner bases. Adv Math Commun. 12(4), 773\u2013804 (2018). \n                    https:\/\/doi.org\/10.3934\/amc.2018046\n                    \n                  .","journal-title":"Adv Math Commun."},{"issue":"1","key":"563_CR5","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(1), 3\u201316 (1985).","journal-title":"Probl. Inf. Transm."},{"key":"563_CR6","unstructured":"Gabidulin E.M., Paramonov A.V., Tretjakov O.V.: Rank errors and rank erasures correction. In: International Colloquium Coding Theory (1991)."},{"key":"563_CR7","doi-asserted-by":"crossref","unstructured":"Gabidulin E.M., Pilipchuk N.I.: A new method of erasure correction by rank codes. In: IEEE International Symposium of Information Theory (ISIT), p. 423 (2003).","DOI":"10.1109\/ISIT.2003.1228440"},{"issue":"1\u20133","key":"563_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-008-9185-7","volume":"49","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin E.M., Pilipchuk N.I.: Error and erasure correcting algorithms for rank codes. Des. Codes Cryptogr. 49(1\u20133), 105\u2013122 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"563_CR9","doi-asserted-by":"publisher","unstructured":"Gadouleau M., Yan Z.: Complexity of decoding Gabidulin codes. In: 42nd Annual Conference on Information Sciences and Systems (CISS), pp. 1081\u20131085 (2008). \n                    https:\/\/doi.org\/10.1109\/CISS.2008.4558679\n                    \n                  .","DOI":"10.1109\/CISS.2008.4558679"},{"key":"563_CR10","first-page":"146","volume":"19","author":"V Guruswami","year":"2012","unstructured":"Guruswami V., Xing C.: List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the singleton bound. Electron. Colloq. Comput. Complex. 19, 146 (2012).","journal-title":"Electron. Colloq. Comput. Complex."},{"key":"563_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn R.A., Johnson C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)."},{"issue":"8","key":"563_CR12","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008). \n                    https:\/\/doi.org\/10.1109\/TIT.2008.926449\n                    \n                  .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"563_CR13","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10623-014-9954-4","volume":"73","author":"W Li","year":"2014","unstructured":"Li W., Sidorenko V., Silva D.: On transform-domain error and erasure correction by Gabidulin codes. Des. Codes Cryptogr. 73, 571\u2013586 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"563_CR14","volume-title":"Finite Fields. Encyclopedia of Mathematics and Its Applications","author":"R Lidl","year":"1996","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1996)."},{"key":"563_CR15","unstructured":"Loidreau P., Overbeck R.: Decoding rank errors beyond the error correcting capability. In: International Workshop Algebraic and Combinatorial Coding Theory (ACCT), pp. 186\u2013190 (2006)."},{"key":"563_CR16","unstructured":"Overbeck R.: Decoding interleaved Gabidulin codes and ciphertext-security for GPT variants (preprint)."},{"key":"563_CR17","unstructured":"Overbeck R.: Public key cryptography based on coding theory. PhD thesis, TU Darmstadt, Darmstadt, Germany (2007)."},{"key":"563_CR18","unstructured":"Richter G., Plass S.: Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. In: ITG Conference on Source Channel Coding (SCC) (2004)."},{"issue":"2","key":"563_CR19","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TIT.2010.2096032","volume":"57","author":"VR Sidorenko","year":"2011","unstructured":"Sidorenko V.R., Jiang L., Bossert M.: Skew-feedback shift-register synthesis and decoding interleaved Gabidulin codes. IEEE Trans. Inf. Theory 57(2), 621\u2013632 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"563_CR20","doi-asserted-by":"publisher","first-page":"6025","DOI":"10.1109\/TIT.2011.2162173","volume":"57","author":"VR Sidorenko","year":"2011","unstructured":"Sidorenko V.R., Richter G., Bossert M.: Linearized shift-register synthesis. IEEE Trans. Inf. Theory 57(9), 6025\u20136032 (2011). \n                    https:\/\/doi.org\/10.1109\/TIT.2011.2162173\n                    \n                  .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"563_CR21","unstructured":"Silva D.: Error control for network coding. PhD thesis, University of Toronto, Toronto, Canada (2009)."},{"issue":"9","key":"563_CR22","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva D., Kschischang F.R., K\u00f6tter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951\u20133967 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"563_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10623-007-9125-y","volume":"46","author":"V Skachek","year":"2008","unstructured":"Skachek V., Roth R.M.: Probabilistic algorithm for finding roots of linearized polynomials. Des. Codes Cryptogr. 46(1), 17\u201323 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"563_CR24","unstructured":"Wachter-Zeh A., Zeh A.: Interpolation-based decoding of interleaved Gabidulin codes. In: International Workshop on Coding and Cryptography (WCC) (2013)."},{"issue":"2","key":"563_CR25","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10623-014-9953-5","volume":"73","author":"A Wachter-Zeh","year":"2014","unstructured":"Wachter-Zeh A., Zeh A.: List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques. Des. Codes Cryptogr. 73(2), 547\u2013570 (2014). \n                    https:\/\/doi.org\/10.1007\/s10623-014-9953-5\n                    \n                  .","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0563-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0563-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0563-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:10:02Z","timestamp":1570561802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0563-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,9]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0563-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,9]]},"assertion":[{"value":"6 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}