{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:19:10Z","timestamp":1770527950569,"version":"3.49.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"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":[[2020,10,21]]},"DOI":"10.1109\/ictc49870.2020.9289350","type":"proceedings-article","created":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T17:58:16Z","timestamp":1608573496000},"page":"227-232","source":"Crossref","is-referenced-by-count":7,"title":["Quantum Maximum Likelihood Decoding for Linear Block Codes"],"prefix":"10.1109","author":[{"given":"Hyunwoo","family":"Jung","sequence":"first","affiliation":[{"name":"KAIST,School of Electrical Engineering,Daejeon,Korea"}]},{"given":"Jeonghwan","family":"Kang","sequence":"additional","affiliation":[{"name":"KAIST,School of Electrical Engineering,Daejeon,Korea"}]},{"given":"Jeongseok","family":"Ha","sequence":"additional","affiliation":[{"name":"KAIST,School of Electrical Engineering,Daejeon,Korea"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.012514.130615"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2013.2259536"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2882385"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2016.7880930"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2322013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6884212"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"ref9","article-title":"A quantum algorithm for finding the minimum","author":"durr","year":"1996"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1119\/1.1463744"}],"event":{"name":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","location":"Jeju, Korea (South)","start":{"date-parts":[[2020,10,21]]},"end":{"date-parts":[[2020,10,23]]}},"container-title":["2020 International Conference on Information and Communication Technology Convergence (ICTC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9289075\/9289076\/09289350.pdf?arnumber=9289350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T18:40:01Z","timestamp":1762972801000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9289350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,21]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ictc49870.2020.9289350","relation":{},"subject":[],"published":{"date-parts":[[2020,10,21]]}}}