{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:10Z","timestamp":1773376990524,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195325","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Guesswork Complexity of Ordered Statistics Decoding and its Saturation Threshold"],"prefix":"10.1109","author":[{"given":"Chentao","family":"Yue","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, the University of Sydney,NSW,Australia"}]},{"given":"Branka","family":"Vucetic","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, the University of Sydney,NSW,Australia"}]},{"given":"Yonghui","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, the University of Sydney,NSW,Australia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3282543"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800181"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616900"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2200275"},{"key":"ref6","volume-title":"Bounds on the minimum distance of linear codes and quantum codes","author":"Grassl","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3078575"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3058978"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps56602.2022.10008654"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2927218"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500810"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3207206"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965916"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261948"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887478"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3097322"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2024.3416515"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206555"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/A-SSCC53895.2021.9634714"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3559168"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195325.pdf?arnumber=11195325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:50Z","timestamp":1773347390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195325","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}