ABSTRACT
Alice and Bob are connected via a two-way channel, and Alice wants to send a message of L bits to Bob. An adversary flips an arbitrary but finite number of bits, T, on the channel. This adversary knows our algorithm and Alice's message, but does not know any private random bits generated by Alice or Bob, nor the bits sent over the channel, except when these bits can be predicted by knowledge of Alice's message or our algorithm. We want Bob to receive Alice's message and for both players to terminate, with error probability at most δ > 0, where δ is a parameter known to both Alice and Bob. Unfortunately, the value T is unknown in advance to either Alice or Bob, and the value L is unknown in advance to Bob.
We describe an algorithm to solve the above problem while sending an expected L + O(T + min(T + 1, L /log L) log (L /δ)) bits. A special case is when δ = O (1/LC), for some constant c. Then when T = o (L /log L), the expected number of bits sent is L + o(L), and when T = Ω(L), the expected number of bits sent is L + O (T), which is asymptotically optimal.
- Abhinav Aggarwal, Varsha Dani, Thomas P Hayes, and Jared Saia. 2017. Distributed Computing with Channel Noise. eprint.iacr.org:20170725:171227 (2017).Google Scholar
- Riccardo Bassoli, Hugo Marques, Jonathan Rodriguez, Kenneth W Shum, and Rahim Tafazolli. 2013. Network coding theory: A survey. IEEE Communications Surveys & Tutorials 15, 4 (2013), 1950--1978.Google ScholarCross Ref
- Zvika Brakerski and Yael Tauman Kalai. 2012. Efficient Interactive Coding against Adversarial Noise. In 53rd IEEE Annual Symposium on Foundations of Computer Science (FOCS). 160--166. Google ScholarDigital Library
- Zvika Brakerski and Moni Naor. 2013. Fast Algorithms for Interactive Coding. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 443--456. Google ScholarDigital Library
- Mark Braverman. 2012. Coding for Interactive Computation: Progress and Challenges. In 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 1914--1921.Google Scholar
- Mark Braverman. 2012. Towards Deterministic Tree Code Constructions. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS). 161--167. Google ScholarDigital Library
- Mark Braverman and Klim Efremenko. 2014. List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on. 236--245. Google ScholarDigital Library
- Mark Braverman and Anup Rao. 2011. Towards Coding for Maximum Errors in Interactive Communication. In Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (STOC). 159--166. Google ScholarDigital Library
- Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, and Daniel Wichs. 2008. Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In Advances in Cryptology--EUROCRYPT 2008. Springer, 471--488. Google ScholarDigital Library
- Varsha Dani, Thomas Hayes, Mahnush Movahedi, Jared Saia, and Maxwell Young. 2015. Interactive Communication with Unknown Noise Rate. CoRR abs/1504.06316 (2015). http://arxiv.org/abs/1504.06316Google Scholar
- Devdatt P Dubhashi and Alessandro Panconesi. 2009. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press. Google ScholarDigital Library
- Matthew Franklin, Ran Gelles, Rafail Ostrovsky, and Leonard Schulman. 2015. Optimal Coding for Streaming Authentication and Interactive Communication. IEEE Transactions on Information Theory 61, 1 (Jan 2015), 133--145.Google ScholarCross Ref
- Ran Gelles, Ankur Moitra, and Amit Sahai. 2011. Efficient and Explicit Coding for Interactive Communication. In Foundations of Computer Science (FOCS). 768--777. Google ScholarDigital Library
- Mohsen Ghaffari and Bernhard Haeupler. 2013. Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. (2013). Available at: http://arxiv.org/abs/1312.1763.Google Scholar
- Mohsen Ghaffari, Bernhard Haeupler, and Madhu Sudan. 2014. Optimal Error Rates for Interactive Coding I: Adaptivity and Other Settings. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC). 794--803. Google ScholarDigital Library
- Bernhard Haeupler. 2014. Interactive channel capacity revisited. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on. IEEE, 226--235. Google ScholarDigital Library
- Morteza Hashemi and Ari Trachtenberg. 2014. Near real-time rateless coding with a constrained feedback budget. In Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on. IEEE, 529--536.Google ScholarCross Ref
- Soung Chang Liew, Shengli Zhang, and Lu Lu. 2013. Physical-layer network coding: Tutorial, survey, and beyond. Physical Communication 6 (2013), 4--42.Google ScholarCross Ref
- Michael Luby. 2002. LT codes. In null. IEEE, 271.Google Scholar
- David JC MacKay. 2005. Fountain codes. In Communications, IEE Proceedings-, Vol. 152. IET, 1062--1068.Google ScholarCross Ref
- Takahiro Matsuda, Taku Noguchi, and Tetsuya Takine. 2011. Survey of network coding and its applications. IEICE transactions on communications 94, 3 (2011), 698--717.Google Scholar
- Michael Mitzenmacher. 2004. Digital fountains: A survey and look forward. In Information Theory Workshop, 2004. IEEE. IEEE, 271--276.Google ScholarCross Ref
- Cristopher Moore and Leonard J. Schulman. 2014. Tree Codes and a Conjecture on Exponential Sums. In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS). 145--154. Google ScholarDigital Library
- Joseph Naor and Moni Naor. 1993. Small-bias probability spaces: Efficient constructions and applications. SIAM journal on computing 22, 4 (1993), 838--856. Google ScholarDigital Library
- Rafail Ostrovsky, Yuval Rabani, and Leonard J. Schulman. 2009. Error-Correcting Codes for Automatic Control. Information Theory, IEEE Transactions on 55, 7 (July 2009), 2931--2941. Google ScholarDigital Library
- Ravi Palanki and Jonathan S Yedidia. 2004. Rateless codes on noisy channels. In IEEE International Symposium on Information Theory. Citeseer, 37--37.Google ScholarCross Ref
- Marcin Peczarski. 2006. An Improvement of the Tree Code Construction. Inform. Process. Lett. 99, 3 (Aug. 2006), 92--95. Google ScholarDigital Library
- Irving S Reed and Gustave Solomon. 1960. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics 8, 2 (1960), 300--304.Google ScholarCross Ref
- L.J. Schulman. 1992. Communication on Noisy Channels: A Coding Theorem for Computation. In Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on. 724--733. Google ScholarDigital Library
- Leonard J. Schulman. 1993. Deterministic Coding for Interactive Communication. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC). 747--756. Google ScholarDigital Library
- Lloyd R Welch and Elwyn R Berlekamp. 1986. Error correction for algebraic block codes. (Dec. 30 1986). US Patent 4,633,470.Google Scholar
Index Terms
- Sending a Message with Unknown Noise
Recommendations
Constant-rate coding for multiparty interactive communication is impossible
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of ComputingWe study coding schemes for multiparty interactive communication over synchronous networks that suffer from stochastic noise, where each bit is independently flipped with probability ε. We analyze the minimal overhead that must be added by the coding ...
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer ScienceIn this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the ...
Improved parallel polynomial division and its extensions
SFCS '92: Proceedings of the 33rd Annual Symposium on Foundations of Computer ScienceThe authors compute the first N coefficients of the reciprocal r(x) of a given polynomial p(x), (r(x)p(x)=1 mod x/sup N/, p(0) not=0), by using, under the PRAM arithmetic models, O(h log N) time-steps and O((N/h)(1+2/sup -h/log/sup (h)/ N)) processors, ...
Comments