{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T15:33:11Z","timestamp":1784820791018,"version":"3.55.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,13]]},"DOI":"10.1109\/esscirc53450.2021.9567867","type":"proceedings-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T21:10:54Z","timestamp":1635282654000},"page":"239-246","source":"Crossref","is-referenced-by-count":56,"title":["Multi-Code Multi-Rate Universal Maximum Likelihood Decoder using GRAND"],"prefix":"10.1109","author":[{"given":"Arslan","family":"Riaz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vaibhav","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit","family":"Solomon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"An","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qijun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Galligan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ken R.","family":"Duffy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rabia Tugce","family":"Yazicigil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439211"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICICDT.2010.5510284"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.7873\/DATE2014.222"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2006.1696082"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2010.2065630"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/TVLSI.2013.2264687","article-title":"High-throughput and low-complexity BCH decoding architecture for solid-state drives","volume":"22","author":"lee","year":"2014","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/VLSICircuits18222.2020.9163022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2020.3005763"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2896110"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2896110"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref6","author":"berlekamp","year":"1968","journal-title":"Algebraic Coding Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref2","article-title":"Selection of cyclic redundancy code and checksum algorithms to ensure critical data integrity","author":"koopman","year":"2015","journal-title":"DOT\/FAA\/TC-14\/49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2004.1311885"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149208"},{"key":"ref22","article-title":"CRC codes as error correcting codes","author":"an","year":"2021","journal-title":"IEEE ICC"},{"key":"ref21","article-title":"Ordered reliability bits guessing random additive noise decoding","author":"duffy","year":"2021","journal-title":"IEEE ICASSP"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2816073"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057464"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS50750.2020.9195254"}],"event":{"name":"ESSCIRC 2021 - IEEE 47th European Solid State Circuits Conference (ESSCIRC)","location":"Grenoble, France","start":{"date-parts":[[2021,9,13]]},"end":{"date-parts":[[2021,9,22]]}},"container-title":["ESSCIRC 2021 - IEEE 47th European Solid State Circuits Conference (ESSCIRC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9567713\/9567736\/09567867.pdf?arnumber=9567867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:53:22Z","timestamp":1652201602000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9567867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/esscirc53450.2021.9567867","relation":{},"subject":[],"published":{"date-parts":[[2021,9,13]]}}}