{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T21:22:56Z","timestamp":1694121776701},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/tvlsi.2010.2096239","type":"journal-article","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T13:53:44Z","timestamp":1294408424000},"page":"296-309","source":"Crossref","is-referenced-by-count":7,"title":["Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control"],"prefix":"10.1109","volume":"20","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhiyuan","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Maximilien","family":"Gadouleau","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Bruce W.","family":"Suter","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.810782"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MSE.2007.44"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2006.12"},{"key":"ref30","author":"berlekamp","year":"1984","journal-title":"Algebraic Coding Theory"},{"key":"ref10","first-page":"2858","article-title":"Fast encoding and decoding of Gabidulin codes","author":"kschischang","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref11","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Proc Ann Allerton Conf Commun Control and Computing"},{"key":"ref12","first-page":"249","article-title":"Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm","author":"richter","year":"2004","journal-title":"Proc 5th Int ITG Conf Source and Channel Coding (SCC)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2009891"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054655"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/92.953498"},{"key":"ref16","author":"lancaster","year":"1985","journal-title":"The Theory of Matrices"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924697"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205854"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351428"},{"key":"ref28","year":"1986","journal-title":"Computational method and apparatus for finite field arithmetic"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20045307"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056705"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref6","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transm"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004590"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032817"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref9","first-page":"1081","article-title":"Complexity of decoding Gabidulin codes","author":"gadouleau","year":"1921","journal-title":"Proc 40th Ann Conf Inf Sci Syst (CISS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1934-1501740-7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/1989849"},{"key":"ref24","author":"berlekamp","year":"1968","journal-title":"Algebraic Coding Theory"},{"key":"ref23","first-page":"36","article-title":"A Welch-Berlekamp like algorithm for decoding Gabidulin codes","volume":"3969","author":"loidreau","year":"2005","journal-title":"Proc 4th Int Workshop Coding and Cryptography (WCC'05)"},{"key":"ref26","author":"mastrovito","year":"1991","journal-title":"VLSI architectures for computations in Galois fields"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9125-y"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/92\/6129939\/05682080.pdf?arnumber=5682080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:20Z","timestamp":1633909580000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5682080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2010.2096239","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"value":"1063-8210","type":"print"},{"value":"1557-9999","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}