{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T05:07:47Z","timestamp":1738732067060,"version":"3.37.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T00:00:00Z","timestamp":1731196800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T00:00:00Z","timestamp":1731196800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202308050115"],"award-info":[{"award-number":["202308050115"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,10]]},"DOI":"10.23919\/isita60732.2024.10858262","type":"proceedings-article","created":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T18:24:59Z","timestamp":1738607099000},"page":"12-17","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Algorithm for Maximum Likelihood Decoding of Non-Binary Codes"],"prefix":"10.23919","author":[{"given":"Yingtao","family":"Zhou","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464\u20138601"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Kaji","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464\u20138601"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(70)90214-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2896110"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/26.536908"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.661515"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.567691"},{"key":"ref7","first-page":"335","article-title":"An Efficient Call-by-Need Algorithm for the Maximum Likelihood Decoding of a Linear Code","volume-title":"2000 Intl. Symp. on Inf. Theory and Its Applications","author":"Kaji","year":"2000"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.312155"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.490504"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2002.805279"},{"issue":"6","key":"ref12","first-page":"1","article-title":"On Lattices, Learning with Errors","volume":"56","author":"Regev","year":"2009","journal-title":"Random Linear Codes, and Cryptography. J. of the ACM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.10009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664355"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149208"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174065"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3810-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"volume-title":"A Survey on Code-based Cryptography","year":"2024","author":"Weger","key":"ref19"}],"event":{"name":"2024 International Symposium on Information Theory and Its Applications (ISITA)","start":{"date-parts":[[2024,11,10]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2024,11,13]]}},"container-title":["2024 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10858199\/10858201\/10858262.pdf?arnumber=10858262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T05:19:02Z","timestamp":1738646342000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10858262\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,10]]},"references-count":19,"URL":"https:\/\/doi.org\/10.23919\/isita60732.2024.10858262","relation":{},"subject":[],"published":{"date-parts":[[2024,11,10]]}}}