{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:48Z","timestamp":1761292908235},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T00:00:00Z","timestamp":1333497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s10623-012-9659-5","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T09:20:02Z","timestamp":1333444802000},"page":"57-73","source":"Crossref","is-referenced-by-count":34,"title":["Fast decoding of Gabidulin codes"],"prefix":"10.1007","volume":"66","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Afanassiev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Sidorenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,4]]},"reference":[{"issue":"3","key":"9659_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P. Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9659_CR2","first-page":"126","volume-title":"Algebraic Coding, Lecture Notes in Computer Science, vol. 573, chap. 16.","author":"E. Gabidulin","year":"1992","unstructured":"Gabidulin E.: A fast matrix decoding algorithm for rank-error-correcting codes. In: Cohen, G., Lobstein, A., Z\u00e9mor, G., Litsyn, S. (eds) Algebraic Coding, Lecture Notes in Computer Science, vol. 573, chap. 16., pp. 126\u2013133. Springer, Berlin (1992)"},{"issue":"1","key":"9659_CR3","first-page":"3","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Peredachi Inf. 21(1), 3\u201316 (1985)","journal-title":"Probl. Peredachi Inf."},{"key":"9659_CR4","unstructured":"Gabidulin E.M., Afanasyev V.B.: Kodirovanie v radioelektronike (Coding in Radio Electronics), in Russian (1986)."},{"key":"9659_CR5","unstructured":"Gadouleau M., Yan Z.: Complexity of decoding Gabidulin codes. In: Information Sciences and Systems, 2008. CISS 2008., pp. 1081\u20131085 (2008)."},{"key":"9659_CR6","unstructured":"Gao S.: Normal bases over finite fields. PhD thesis, University of Waterloo, Department of Combinatorics and Optimization (1993)."},{"key":"9659_CR7","unstructured":"Gao S.: A New Algorithm for Decoding Reed\u2013Solomon Codes. Communications, Information and Network Security, pp. 55\u201368. Kluwer, Norwell (2002)."},{"key":"9659_CR8","unstructured":"Hassan Y., Sidorenko V.: Fast recursive linearized feedback shift register synthesis. In: Twelfth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2010), pp. 162\u2013167 (2010)."},{"issue":"8","key":"9659_CR9","doi-asserted-by":"crossref","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)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9659_CR10","doi-asserted-by":"crossref","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1996).","DOI":"10.1017\/CBO9780511525926"},{"key":"9659_CR11","doi-asserted-by":"crossref","unstructured":"Loidreau P.: A Welch\u2013Berlekamp like algorithm for decoding Gabidulin codes. Coding Cryptogr. pp. 36\u201345 (2006).","DOI":"10.1007\/11779360_4"},{"key":"9659_CR12","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1090\/S0002-9947-1933-1501703-0","volume":"35","author":"O. Ore","year":"1933","unstructured":"Ore O.: On a special class of polynomials. Trans. Am. Math. Soc. 35, 559\u2013584 (1933)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"9659_CR13","doi-asserted-by":"crossref","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"O. Ore","year":"1933","unstructured":"Ore O.: Theory of non-commutative polynomials. Ann. Math. 34(3), 480\u2013508 (1933)","journal-title":"Ann. Math."},{"key":"9659_CR14","unstructured":"Paramonov A.V., Tretjakov O.V.: An analogue of Berlekamp\u2013Massey algorithm for decoding codes in Rank Metric. In: Proceedings of MIPT (1991)."},{"key":"9659_CR15","unstructured":"Richter G., Plass S.: Error and erasure decoding of rank-codes with a modified Berlekamp\u2013Massey algorithm. In: 5th International ITG Conference on Source and Channel Coding (SCC), Erlangen, pp. 203\u2013211 (2004)."},{"key":"9659_CR16","unstructured":"Richter G., Plass S.: Fast decoding of rank-codes with rank errors and column erasures. In: International Symposium on Information Theory 2004, ISIT 2004, p. 398 (2004)."},{"issue":"2","key":"9659_CR17","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"R.M. Roth","year":"1991","unstructured":"Roth R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37(2), 328\u2013336 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"9659_CR18","doi-asserted-by":"crossref","first-page":"6025","DOI":"10.1109\/TIT.2011.2162173","volume":"57","author":"V.R. Sidorenko","year":"2011","unstructured":"Sidorenko V.R., Richter G., Bossert M.: Linearized shift-register synthesis. IEEE Trans. Inf. Theory 57(9), 6025\u20136032 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9659_CR19","doi-asserted-by":"crossref","unstructured":"Silva D., Kschischang F.R.: Fast encoding and decoding of Gabidulin codes. In: IEEE International Symposium on Information Theory 2009 (2009).","DOI":"10.1109\/ISIT.2009.5205272"},{"issue":"9","key":"9659_CR20","doi-asserted-by":"crossref","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D. Silva","year":"2008","unstructured":"Silva D., Kschischang F.R., Koetter 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":"9659_CR21","doi-asserted-by":"crossref","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."},{"issue":"1","key":"9659_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(75)90090-X","volume":"27","author":"Y. Sugiyama","year":"1975","unstructured":"Sugiyama Y., Kasahara M., Hirasawa S., Namekawa T.: A method for solving key equation for decoding Goppa codes. Inf. Control 27(1), 87\u201399 (1975)","journal-title":"Inf. Control"},{"key":"9659_CR23","unstructured":"Wachter A., Afanassiev V., Sidorenko V.: Fast decoding of Gabidulin codes. In: The Seventh International Workshop on Coding and Cryptography 2011 (WCC 2011), pp. 433\u2013442 (2011)."},{"key":"9659_CR24","unstructured":"Wachter A., Sidorenko V., Bossert M.: A fast linearized Euclidean algorithm for decoding Gabidulin codes. In: Twelfth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2010), pp. 298\u2013303 (2010)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9659-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9659-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9659-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T13:04:46Z","timestamp":1561554286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9659-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,4]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9659"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9659-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,4]]}}}