{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:42Z","timestamp":1773376962571,"version":"3.50.1"},"reference-count":15,"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.11195247","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":1,"title":["Binary Rate-Optimal Streaming Codes with Minimal Code Length"],"prefix":"10.1109","author":[{"given":"Wenjie","family":"Ma","sequence":"first","affiliation":[{"name":"State Key Laboratory of Mathematical Sciences, AMSS,Chinese Academy of Sciences,Beijing,China,100190"}]},{"given":"Zhifang","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Sciences, AMSS,Chinese Academy of Sciences,Beijing,China,100190"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834844"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2618924"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2983152"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437570"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2894124"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206546"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3328812"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2956500"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174218"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2944372"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3121101"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928287"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206862"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/9781119098799"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557355"}],"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\/11195247.pdf?arnumber=11195247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:39Z","timestamp":1773347379000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195247\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195247","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}