{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:49Z","timestamp":1773376609055,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206921","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2135-2140","source":"Crossref","is-referenced-by-count":1,"title":["Characterization of All Optimal Finite-length Codes of Size Four for Binary Symmetric Channels"],"prefix":"10.1109","author":[{"given":"Yanyan","family":"Dong","sequence":"first","affiliation":[{"name":"National University of Singapore,Department of Electrical and Computer Engineering,Singapore"}]},{"given":"Shenghao","family":"Yang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen,School of Science and Engineering,Shenzhen,China"}]}],"member":"263","reference":[{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276893"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620779"},{"key":"ref12","first-page":"146","article-title":"On optimal finite-length binary codes of four codewords for binary symmetric channels","author":"dong","year":"2020","journal-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_75"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)90128-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057538"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053987"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2834924"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054052"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2542080"},{"key":"ref2","author":"peterson","year":"1972","journal-title":"Error-Correcting Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb02379.x"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206921.pdf?arnumber=10206921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:54Z","timestamp":1773347214000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206921","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}