{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:11:45Z","timestamp":1778263905087,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":6,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_387","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:50:14Z","timestamp":1319709014000},"page":"1028-1031","source":"Crossref","is-referenced-by-count":4,"title":["Rank Codes"],"prefix":"10.1007","author":[{"given":"Ernst M","family":"Gabidulin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"387_CR1_387","first-page":"109","volume":"1","author":"L-K Hua","year":"1951","unstructured":"Hua L-K (1951) A theorem on matrices over a field and its applications. Chin Math Soc 1(2):109\u2013163","journal-title":"Chin Math Soc"},{"key":"387_CR2_387","first-page":"226","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P (1978) Bilinear forms over a finite field, with applications to coding theory. J Comb Theory A 25:226\u2013241","journal-title":"J Comb Theory A"},{"issue":"1","key":"387_CR3_387","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin EM (1985) Theory of codes with maximum rank distance. Probl Inf Transm 21(1):1\u201312","journal-title":"Probl Inf Transm"},{"key":"387_CR4_387","unstructured":"Gabidulin EM, Paramonov AV, Tretjakov OV (1992) Rank errors and rank erasures correction. In: Proceedings of the 4th international colloquium on coding theory, 30 September\u20137 October 1991, Dilijan, Armenia, pp 11\u201319, Yerevan, 1992"},{"key":"387_CR5_387","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-008-9185-7","volume":"49","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin EM, Pilipchuk NI (2008) Error and erasure correcting algorithms for rank codes. Designs Codes Cryptogr 49:105\u2013122. DOI 10.1007\/s10623-008-9185-7","journal-title":"Designs Codes Cryptogr"},{"issue":"9","key":"387_CR6_387","first-page":"3951","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva D, Kschischang FR, Koetter R (2008) A rank-metric approach to error control in random network coding. IEEE Trans Inf Theory 54(9):3951\u20133967","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:56:52Z","timestamp":1778263012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_387","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}