Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improved bounds on the interactive capacity via error pattern analysis (2401.15355v2)

Published 27 Jan 2024 in cs.IT and math.IT

Abstract: Any interactive protocol between a pair of parties can be reliably simulated in the presence of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The reciprocal of the best (least) overhead is called the interactive capacity of the noisy channel. In this work, we present lower bounds on the interactive capacity of the binary erasure channel. Our lower bound improves the best known bound due to Ben-Yishai et al. 2021 by roughly a factor of 1.75. The improvement is due to a tighter analysis of the correctness of the simulation protocol using error pattern analysis. More precisely, instead of using the well-known technique of bounding the least number of erasures needed to make the simulation fail, we identify and bound the probability of specific erasure patterns causing simulation failure. We remark that error pattern analysis can be useful in solving other problems involving stochastic noise, such as bounding the interactive capacity of different channels.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (24)
  1. L. J. Schulman, “Coding for interactive communication,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1745–1756, 1996.
  2. G. Kol and R. Raz, “Interactive channel capacity,” in Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, ser. STOC ’13.   New York, NY, USA: Association for Computing Machinery, 2013, p. 715–724. [Online]. Available: https://doi.org/10.1145/2488608.2488699
  3. A. Ben-Yishai, Y.-H. Kim, O. Ordentlich, and O. Shayevitz, “A lower bound on the essential interactive capacity of binary memoryless symmetric channels,” IEEE Transactions on Information Theory, vol. 67, no. 12, pp. 7639–7658, 2021.
  4. K. Efremenko, R. Gelles, and B. Haeupler, “Maximal noise in interactive communication over erasure channels and channels with feedback,” IEEE Transactions on Information Theory, vol. 62, no. 8, pp. 4575–4588, 2016.
  5. S. Rajagopalan and L. Schulman, “A coding theorem for distributed computation,” in Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, ser. STOC ’94.   New York, NY, USA: Association for Computing Machinery, 1994, p. 790–799. [Online]. Available: https://doi.org/10.1145/195058.195462
  6. V. Moulos, “A hoeffding inequality for finite state markov chains and its applications to markovian bandits,” in 2020 IEEE International Symposium on Information Theory (ISIT), 2020, pp. 2777–2782.
  7. R. Gelles, “Coding for interactive communication: A survey,” Foundations and Trends® in Theoretical Computer Science, vol. 13, no. 1–2, pp. 1–157, 2017.
  8. M. Braverman and A. Rao, “Toward coding for maximum errors in interactive communication,” IEEE Transactions on Information Theory, vol. 60, no. 11, pp. 7248–7255, 2014.
  9. M. Gupta and R. Y. Zhang, “Efficient interactive coding achieving optimal error resilience over the binary channel,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, B. Saha and R. A. Servedio, Eds.   ACM, 2023, pp. 1449–1462. [Online]. Available: https://doi.org/10.1145/3564246.3585162
  10. M. Mukherjee and R. Gelles, “Multiparty interactive coding over networks of intersecting broadcast links,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 4, pp. 1078–1092, 2021.
  11. K. Efremenko, G. Kol, and R. Saxena, “Interactive coding over the noisy broadcast channel,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, 2018, pp. 507–520.
  12. K. Efremenko, G. Kol, D. Paramonov, and R. R. Saxena, “Tight bounds for general computation in noisy broadcast networks,” in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, pp. 634–645.
  13. N. Alon, M. Braverman, K. Efremenko, R. Gelles, and B. Haeupler, “Reliable communication over highly connected noisy networks,” in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, ser. PODC ’16.   New York, NY, USA: Association for Computing Machinery, 2016, p. 165–173. [Online]. Available: https://doi.org/10.1145/2933057.2933085
  14. R. Gelles and Y. T. Kalai, “Constant-rate interactive coding is impossible, even in constant-degree networks,” IEEE Transactions on Information Theory, vol. 65, no. 6, pp. 3812–3829, 2019.
  15. M. Braverman, K. Efremenko, R. Gelles, and B. Haeupler, “Constant-rate coding for multiparty interactive communication is impossible,” J. ACM, vol. 65, no. 1, Dec. 2017. [Online]. Available: https://doi.org/10.1145/3050218
  16. A. Jain, Y. T. Kalai, and A. Lewko, “Interactive coding for multiparty protocols,” in Proceedings of the 6th Conference on Innovations in Theoretical Computer Science, ITCS ’15, 2015, pp. 1–10.
  17. W. M. Hoza and L. J. Schulman, “The adversarial noise threshold for distributed protocols,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016, pp. 240–258.
  18. R. Gelles, Y. T. Kalai, and G. Ramnarayan, “Efficient multiparty interactive coding—part I: Oblivious insertions, deletions and substitutions,” IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3411–3437, 2021.
  19. ——, “Efficient multiparty interactive coding—part II: Non-oblivious noise,” IEEE Transactions on Information Theory, vol. 68, no. 7, pp. 4723–4749, 2022.
  20. K. Efremenko, G. Kol, and R. R. Saxena, “Noisy beeps,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, ser. PODC ’20.   New York, NY, USA: Association for Computing Machinery, 2020, p. 418–427. [Online]. Available: https://doi.org/10.1145/3382734.3404501
  21. Y. Ashkenazi, R. Gelles, and A. Leshem, “Noisy beeping networks,” Information and Computation, vol. 289, p. 104925, 2022. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0890540122000785
  22. R. Gelles, B. Haeupler, G. Kol, N. Ron-Zewi, and A. Wigderson, “Towards optimal deterministic coding for interactive communication,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA ’16, 2016, p. 1922–1936.
  23. B. Haeupler, “Interactive channel capacity revisited,” in 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014, pp. 226–235.
  24. G. Cohen and S. Samocha, “Palette-alternating tree codes,” in Proceedings of the 35th Computational Complexity Conference, ser. CCC ’20, 2020.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now