Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
暂无分享,去创建一个
[1] Leonard J. Schulman,et al. Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[2] Charles F. Hockett,et al. A mathematical theory of communication , 1948, MOCO.
[3] Gilles Brassard,et al. Noisy Interactive Quantum Communication , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[4] Klim Efremenko,et al. Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2016, IEEE Trans. Inf. Theory.
[5] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[6] Klim Efremenko,et al. Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2015, IEEE Transactions on Information Theory.
[7] E. Gilbert. A comparison of signalling alphabets , 1952 .
[8] Mark Braverman,et al. Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.
[9] Kai-Min Chung,et al. Knowledge-Preserving Interactive Coding , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[10] Amit Sahai,et al. Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.
[11] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.
[12] Amit Sahai,et al. Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[13] Ran Raz,et al. Interactive channel capacity , 2013, STOC '13.
[14] Denis Pankratov,et al. On the Power of Feedback in Interactive Channels , 2013 .
[15] Madhu Sudan,et al. Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.
[16] Bernhard Haeupler,et al. Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[17] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[18] Bernhard Haeupler,et al. Interactive Channel Capacity Revisited , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[19] Yael Tauman Kalai,et al. Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[20] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[21] Mark Braverman,et al. List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise , 2014, FOCS.
[22] Moni Naor,et al. Fast Algorithms for Interactive Coding , 2013, SODA.
[23] Rafail Ostrovsky,et al. Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Transactions on Information Theory.
[24] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.
[25] Amit Sahai,et al. Adaptive protocols for interactive communication , 2013, 2016 IEEE International Symposium on Information Theory (ISIT).