{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:03:01Z","timestamp":1725472981443},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354819"},{"type":"electronic","value":"9783540354826"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779360_2","type":"book-chapter","created":{"date-parts":[[2006,11,16]],"date-time":"2006-11-16T08:17:10Z","timestamp":1163665030000},"page":"14-21","source":"Crossref","is-referenced-by-count":2,"title":["On Codes Correcting Symmetric Rank Errors"],"prefix":"10.1007","author":[{"given":"Nina I.","family":"Pilipchuk","sequence":"first","affiliation":[]},{"given":"Ernst M.","family":"Gabidulin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Gabidulin, E.M., Pilipchuk, N.I.: Transposed Rank Codes Based on Symmetric Matrices. In: Proc. of the WCC 2003, Versailles (France), 24-28 March 2003, pp. 203\u2013211 (2003)"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/B:PRIT.0000043925.67309.c6","volume":"40","author":"E.M. Gabidulin","year":"2004","unstructured":"Gabidulin, E.M., Pilipchuk, N.I.: Symmetric rank codes. Problems of Information Transmission\u00a040(2), 3\u201318 (2004)","journal-title":"Problems of Information Transmission"},{"key":"2_CR3","unstructured":"Gabidulin, E.M., Pilipchuk, N.I.: Symmetric matrices and codes correcting rank errors beyond the \n                  \n                    \n                  \n                  $\\left\\lfloor \\frac{d-1}{2}\\right\\rfloor$\n                 bound. Discrete Applied Mathematic (to be published, 2005)"},{"key":"2_CR4","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1993","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, 8th edn. North Holland Press, Amsterdam (1993)","edition":"8"},{"issue":"1","key":"2_CR5","first-page":"3","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of Codes with Maximum Rank Distance. Problems of Information Transmission\u00a021(1), 3\u201314 (1985)","journal-title":"Problems of Information Transmission"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0034349","volume-title":"Algebraic Coding","author":"E.M. Gabidulin","year":"1992","unstructured":"Gabidulin, E.M.: A Fast Matrix Decoding Algorithm For Rank-Error-Correcting Codes. In: Lobstein, A., Litsyn, S.N., Z\u00e9mor, G., Cohen, G. (eds.) Algebraic Coding 1991. LNCS, vol.\u00a0573, pp. 126\u2013132. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779360_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:53:31Z","timestamp":1552362811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779360_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354819","9783540354826"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11779360_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}