{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:08Z","timestamp":1773377708899,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849699","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"3107-3111","source":"Crossref","is-referenced-by-count":1,"title":["On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel"],"prefix":"10.1109","author":[{"given":"Yujie","family":"Gu","sequence":"first","affiliation":[{"name":"Department of EE – Systems, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[{"name":"Department of EE – Systems, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref11","first-page":"611","article-title":"Two-way communication channels","author":"shannon","year":"1961","journal-title":"Proc 4th Berkeley Symp Mathematics Statistics and Probability"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.841182"},{"key":"ref13","first-page":"1410","article-title":"Sufficient conditions for the tightness of Shannons capacity bounds for two-way channels","author":"weng","year":"2018","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057192"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0195-6698(95)90031-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056847"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.37236\/7210","article-title":"A new upper bound for cancellative pairs","volume":"25","author":"janzer","year":"2018","journal-title":"Electron J Combin"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.42175"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056441"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056027"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535895"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056661"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849699.pdf?arnumber=8849699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:56Z","timestamp":1773347696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849699\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849699","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}