{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:48:00Z","timestamp":1747284480625,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/arith.2018.8464690","type":"proceedings-article","created":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T18:06:04Z","timestamp":1537207564000},"page":"125-129","source":"Crossref","is-referenced-by-count":6,"title":["The Comeback of Reed Solomon Codes"],"prefix":"10.1109","author":[{"given":"Nir","family":"Drucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shay","family":"Gueron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlad","family":"Krasnov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.167"},{"key":"ref13","first-page":"253","article-title":"A performance evaluation and examination of open-source erasure coding libraries for storage","author":"plank","year":"2009","journal-title":"FAST '09 Proccedings of the 7th Conference on File and Storage Technologies"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref15","first-page":"298","article-title":"Screaming fast galois field arithmetic using intel SIMD instructions","author":"plank","year":"2013","journal-title":"The 11th Usenix Conference on File and Storage Technologies (FAST'13)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2008.4484722"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2005.42"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2018.8464777"},{"key":"ref19","article-title":"Making aes great again: the forthcoming vectorized aes instruction","author":"drucker","year":"2018","journal-title":"Cryptology ePrint Archive Report 2018\/392"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"journal-title":"HDFS RAID","year":"2010","author":"reed","key":"ref6"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","article-title":"Polynomial codes over certain finite fields","volume":"8","author":"reed","year":"1960","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"ref8","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proceedings of the 3rd USENIX Conference on File and Storage Technologies USENIX"},{"journal-title":"The Mathematics of RAID-6","year":"2011","author":"anvin","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945450"},{"journal-title":"Intel Architecture Instruction Set Extensions Programming Reference","year":"2017","author":"ghemawat","key":"ref1"},{"key":"ref9","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Presented as part of the 2012 USENIX Annual Technical Conference (USENIX ATC 12)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.3.CO;2-Y"},{"journal-title":"The Intel Intelligent Storage Acceleration Library (Intel ISA-L)","year":"2018","author":"plank","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/spe.631"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.ipl.2010.04.011","article-title":"Efficient implementation of the galois counter mode using a carry-less multiplier and a fast reduction algorithm","volume":"110","author":"gueron","year":"2010","journal-title":"Information Processing Letters"}],"event":{"name":"2018 IEEE 25th Symposium on Computer Arithmetic (ARITH)","start":{"date-parts":[[2018,6,25]]},"location":"Amherst, MA","end":{"date-parts":[[2018,6,27]]}},"container-title":["2018 IEEE 25th Symposium on Computer Arithmetic (ARITH)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8452530\/8464686\/08464690.pdf?arnumber=8464690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T19:23:29Z","timestamp":1539977009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8464690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/arith.2018.8464690","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}