{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:06Z","timestamp":1773377646640,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834528","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2762-2767","source":"Crossref","is-referenced-by-count":2,"title":["On Zero-Error Capacity of \"One-Edge\" Binary Channels with Two Memories"],"prefix":"10.1109","author":[{"given":"Qi","family":"Cao","sequence":"first","affiliation":[{"name":"Xidian University,Xidian-Guangzhou Research Institute,Guangzhou,China"}]},{"given":"Qi","family":"Chen","sequence":"additional","affiliation":[{"name":"Xidian University,State Key Laboratory of Integrated Service Networks,Xi’an,China,710071"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352613"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046211"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.669303"},{"key":"ref5","first-page":"66","article-title":"On zero error capacity of nearest neighbor error channels with multilevel alphabet","author":"nakano","year":"2016","journal-title":"2016 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2830362"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2499751"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022009"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834528.pdf?arnumber=9834528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:45Z","timestamp":1773347685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834528\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834528","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}