{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:50:51Z","timestamp":1755219051970,"version":"3.43.0"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437839","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"621-625","source":"Crossref","is-referenced-by-count":5,"title":["Quadratically Constrained Channels with Causal Adversaries"],"prefix":"10.1109","author":[{"given":"Tongxin","family":"Li","sequence":"first","affiliation":[{"name":"Caltech"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bikash Kumar","family":"Dey","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[{"name":"SUNY Buffalo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Rutgers"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245721"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2746539.2746591","article-title":"A characterization of the capacity of online (causal) binary channels","author":"chen","year":"2015","journal-title":"Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing"},{"key":"ref13","first-page":"915","article-title":"The capacity of online (causal) q-ary error-erasure channels","year":"2016","journal-title":"Information Theory (ISIT) 2016 IEEE International Symposium on"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.133"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513325"},{"key":"ref16","first-page":"880","article-title":"A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures","year":"2016","journal-title":"Information Theory (ISIT) 2016 IEEE International Symposium on"},{"journal-title":"Quadrat-ically constrained channels with causal adversaries","year":"2018","author":"li","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2012.6290241"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057288"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620230"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S2040618500033219"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057672"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref7","first-page":"3","article-title":"On bounds for packings on a sphere and in space","volume":"14","author":"kabatiansky","year":"1978","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.887846"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1949.232969"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.720535"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437839.pdf?arnumber=8437839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:32Z","timestamp":1754502992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437839","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}