{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:25Z","timestamp":1773378025437,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849214","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"21-25","source":"Crossref","is-referenced-by-count":14,"title":["Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel"],"prefix":"10.1109","author":[{"given":"Kirill","family":"Ivanov","sequence":"first","affiliation":[{"name":"School of Computer and Communication Sciences EPFL, Lausanne, CH-1015, Switzerland"}]},{"given":"R\u00fcdiger","family":"Urbanke","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Sciences EPFL, Lausanne, CH-1015, Switzerland"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2018.8377158"},{"key":"ref11","author":"elkelesh","year":"2018"},{"key":"ref12","author":"doan","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513586"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504269"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897584"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205860"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625281"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033904"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595172"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541601"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849214.pdf?arnumber=8849214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:57Z","timestamp":1773347757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849214","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}