{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:39Z","timestamp":1760202699207,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_46","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"575-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Interactive Communication with Unknown Noise Rate"],"prefix":"10.1007","author":[{"given":"Varsha","family":"Dani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahnush","family":"Movahedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxwell","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y.T.: Efficient interactive coding against adversarial noise. In: Foundations of Computer Science (FOCS), pp. 160\u2013166 (2012)","DOI":"10.1109\/FOCS.2012.22"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Naor, M.: Fast algorithms for interactive coding. In: Symposium on Discrete Algorithms (SODA), pp. 443\u2013456 (2013)","DOI":"10.1137\/1.9781611973105.32"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Coding for interactive computation: progress and challenges. In: Communication, Control, and Computing (Allerton), pp. 1914\u20131921, October 2012","DOI":"10.1109\/Allerton.2012.6483456"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Towards deterministic tree code constructions. In: Innovations in Theoretical Computer Science Conference (ITCS), pp. 161\u2013167 (2012)","DOI":"10.1145\/2090236.2090250"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Braverman, M., Efremenko, K.: List and unique coding for interactive communication in the presence of adversarial noise. In: Foundations of Computer Science (FOCS), pp. 236\u2013245 (2014)","DOI":"10.1109\/FOCS.2014.33"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Towards coding for maximum errors in interactive communication. In: Symposium on Theory of Computing (STOC), pp. 159\u2013166 (2011)","DOI":"10.1145\/1993636.1993659"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Feinerman, O., Haeupler, B., Korman, A.: Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. In: Principles of Distributed Computing (PODC), pp. 114\u2013123. ACM (2014)","DOI":"10.1145\/2611462.2611469"},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TIT.2014.2367094","volume":"61","author":"M Franklin","year":"2015","unstructured":"Franklin, M., Gelles, R., Ostrovsky, R., Schulman, L.: Optimal Coding for Streaming Authentication and Interactive Communication. IEEE Transactions on Information Theory 61(1), 133\u2013145 (2015)","journal-title":"IEEE Transactions on Information Theory"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Gelles, R., Moitra, A., Sahai, A.: Efficient and explicit coding for interactive communication. In: Foundations of Computer Science (FOCS), pp. 768\u2013777, October 2011","DOI":"10.1109\/FOCS.2011.51"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding (2013) http:\/\/arxiv.org\/abs\/1312.1763","DOI":"10.1145\/2591796.2591872"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B., Sudan, M.: Optimal Error Rates for Interactive Coding I: Adaptivity and Other Settings. In: Symposium on Theory of Computing (STOC), pp. 794\u2013803 (2014)","DOI":"10.1145\/2591796.2591872"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Interactive channel capacity revisited. In: Foundations of Computer Science (FOCS), pp. 226\u2013235. IEEE (2014)","DOI":"10.1109\/FOCS.2014.32"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Moore, C., Schulman, L.J.: Tree Codes and a Conjecture on Exponential Sums. In: Innovations in Theoretical Computer Science (ITCS), pp. 145\u2013154 (2014)","DOI":"10.1145\/2554797.2554813"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing (SICOMP) 22(4), 838\u2013856","DOI":"10.1137\/0222053"},{"issue":"7","key":"46_CR15","doi-asserted-by":"publisher","first-page":"2931","DOI":"10.1109\/TIT.2009.2021303","volume":"55","author":"R Ostrovsky","year":"2009","unstructured":"Ostrovsky, R., Rabani, Y., Schulman, L.J.: Error-Correcting Codes for Automatic Control. IEEE Transactions on Information Theory 55(7), 2931\u20132941 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"46_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ipl.2006.03.007","volume":"99","author":"M Peczarski","year":"2006","unstructured":"Peczarski, M.: An Improvement of the Tree Code Construction. Information Processing Letters 99(3), 92\u201395 (2006)","journal-title":"Information Processing Letters"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Schulman, L.: Communication on noisy channels: a coding theorem for computation. In: Foundations of Computer Science (FOCS), pp. 724\u2013733, October 1992","DOI":"10.1109\/SFCS.1992.267778"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Schulman, L.J.: Deterministic coding for interactive communication. In: Symposium on Theory of Computing (STOC), pp. 747\u2013756 (1993)","DOI":"10.1145\/167088.167279"},{"issue":"3","key":"46_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A Mathematical Theory of Communication. Bell System Technical Journal 27(3), 379\u2013423 (1948)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:42:42Z","timestamp":1676018562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}