{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:06:32Z","timestamp":1775581592942,"version":"3.50.1"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1149888"],"award-info":[{"award-number":["1149888"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alfred P. Sloan Research Fellowship"},{"name":"National Science Foundation","award":["CCF-1016565"],"award-info":[{"award-number":["CCF-1016565"]}]},{"name":"Alfred P. Sloan Research Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tit.2014.2353994","type":"journal-article","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T17:09:02Z","timestamp":1410196142000},"page":"7248-7255","source":"Crossref","is-referenced-by-count":25,"title":["Toward Coding for Maximum Errors in Interactive Communication"],"prefix":"10.1109","volume":"60","author":[{"given":"Mark","family":"Braverman","sequence":"first","affiliation":[]},{"given":"Anup","family":"Rao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref3","author":"peterson","year":"1972","journal-title":"Error-Correcting Codes"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.22"},{"key":"ref6","author":"schulman","year":"2003","journal-title":"A Postcript to ‘Coding for Interactive Communication’"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.51"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44929-9_3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","first-page":"104","article-title":"Optimal coding for streaming authentication and interactive communication","volume":"19","author":"franklin","year":"2012","journal-title":"Proc Electron Colloq Comput Complexity (ECCC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993659"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6926896\/06891225.pdf?arnumber=6891225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:16Z","timestamp":1641988276000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6891225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":10,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2353994","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}