{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:36Z","timestamp":1771611036387,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2008,3,11]],"date-time":"2008-03-11T00:00:00Z","timestamp":1205193600000},"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":[[2008,12]]},"DOI":"10.1007\/s10623-008-9185-7","type":"journal-article","created":{"date-parts":[[2008,3,10]],"date-time":"2008-03-10T15:40:58Z","timestamp":1205163658000},"page":"105-122","source":"Crossref","is-referenced-by-count":45,"title":["Error and erasure correcting algorithms for rank codes"],"prefix":"10.1007","volume":"49","author":[{"given":"Ernst M.","family":"Gabidulin","sequence":"first","affiliation":[]},{"given":"Nina I.","family":"Pilipchuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,11]]},"reference":[{"issue":"1","key":"9185_CR1","first-page":"3","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin E.M. (1985) Theory of codes with maximum rank distance. Probl. Inform. Transm. 21(1): 3\u201316","journal-title":"Probl. Inform. Transm."},{"issue":"2","key":"9185_CR2","first-page":"102","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin E.M. (1985) Optimal codes correcting array errors. Probl. Inform. Transm. 21(2): 102\u2013106","journal-title":"Probl. Inform. Transm."},{"key":"9185_CR3","unstructured":"Gabidulin E.M., Afanassiev V.B.: Coding in radio engineering. M.: Radio i swaz, 1986, 176\u00a0pp. (In Russian)."},{"key":"9185_CR4","unstructured":"Gabidulin E.M.: A fast matrix decoding algorithm for rank-error-correcting codes. In: Cohen G., Litsyn S., Lobstein A., Zemor G. (eds.) Lecture Notes in Computer Science vol 573. pp. 126\u2013133 Springer-Verlag (1991)."},{"issue":"2","key":"9185_CR5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"R.M. Roth","year":"1991","unstructured":"Roth R.M. (1991) Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inform. Theory 37(2): 328\u2013336","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9185_CR6","unstructured":"Paramonov A.V.: Channel coding and secure data transmission in parallel channels. Ph.D. thesis, Moscow Institute of Physics and Technology (MIPT), Moscow, pp. 1\u2013139 (1992 in Russian)."},{"key":"9185_CR7","doi-asserted-by":"crossref","unstructured":"Richter G., Plass S.: Fast decoding of rank codes with rank errors and column erasures. In: Proceedings of 2004 IEEE International Symposium on Information Theory, ISIT\u201904, 2004.","DOI":"10.1109\/ISIT.2004.1365435"},{"key":"9185_CR8","unstructured":"Loidreau P.: A Welch\u2013Berlekamp like algorithm for decoding Gabidulin codes. In: Itrehus \u00d8. (ed.) Coding and Cryptography\u2014WCC 2005, 4th International Workshop on Coding and Cryptography. LNCS, no. 3969, pp. 36\u201345. Springer (2006)."},{"key":"9185_CR9","unstructured":"Gabidulin E.M., Paramonov A.V., Tretjakov O.V.: Rank errors and rank erasures correction. In: Proceedings of the 4th International Colloquium on Coding Theory, Dilijan, Armenia, 30 Sept.\u20137 Oct. 1991, pp. 11\u201319. Yerevan (1992)."},{"key":"9185_CR10","unstructured":"Pilipchuk N.I., Gabidulin E.M.: Decoding of symmetric rank codes by information sets. In: Proceedings of the Tenth International Workshop, Algebraic and Combinatorial Coding Theory, September 3\u20139, Zvenigorod, Russia. pp. 214\u2013219 (2006)."},{"key":"9185_CR11","unstructured":"Kshevetskiy A.: Information set decoding for codes in rank metric. In: Proceedings of the Ninth International Workshop, Algebraic and Combinatorial Coding Theory, June 19\u201325, Kranevo, Bulgaria. pp. 254\u2013259 (2004)."},{"issue":"2","key":"9185_CR12","first-page":"3","volume":"40","author":"E.M. Gabidulin","year":"2004","unstructured":"Gabidulin E.M., Pilipchuk N.I.(2004) Symmetric rank codes. Prob. Inform. Transm. 40(2): 3\u201318","journal-title":"Prob. Inform. Transm."},{"key":"9185_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.dam.2005.03.012","volume":"154","author":"E.M. Gabidulin","year":"2006","unstructured":"Gabidulin E.M., Pilipchuk N.I. (2006) Symmetric matrices and correcting rank errors beyond (d\u22121)\/2 bound. Discrete Appl. Math. 154: 305\u2013312","journal-title":"Discrete Appl. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9185-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9185-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9185-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:10Z","timestamp":1559245810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9185-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,11]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9185"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9185-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,11]]}}}