{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:38Z","timestamp":1773377618946,"version":"3.50.1"},"reference-count":13,"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.8849839","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1882-1886","source":"Crossref","is-referenced-by-count":4,"title":["Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem"],"prefix":"10.1109","author":[{"given":"Irina E.","family":"Bocharova","sequence":"first","affiliation":[{"name":"Dept. of Information Systems, St. Petersburg Univ. of Information Technologies, St. Petersburg, 197101, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Johansson","sequence":"additional","affiliation":[{"name":"Dept. of Electrical and Information Technology, Lund University, Lund, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris D.","family":"Kudryashov","sequence":"additional","affiliation":[{"name":"Dept. of Information Systems, St. Petersburg Univ. of Information Technologies, St. Petersburg, 197101, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"On Decoding Schemes for the MDPC-McEliece Cryptosystem","author":"bartz","year":"2018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"ref12","article-title":"A Key Recovery Reaction Attack on QC-MDPC","author":"guo","year":"2018","journal-title":"IEEE Trans on Inf Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2700102"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917624"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853321"},{"key":"ref5","first-page":"447","article-title":"Generating code representations suitable for belief propagation decoding","volume":"40","author":"yedidia","year":"2002","journal-title":"Proc Annu Allerton Conf Commun Control and Comp"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437588"},{"key":"ref7","first-page":"1","article-title":"Improved iterative decoding of LDPC codes from the IEEE WiMAX standard","author":"hehn","year":"2010","journal-title":"Int Conf Source Channel Coding (SCC)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541790"}],"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\/08849839.pdf?arnumber=8849839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:38Z","timestamp":1773347678000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849839","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}