Optimality of the recursive data exchange protocol

Tyagi, Himanshu and Watanabe, Shun (2017) Optimality of the recursive data exchange protocol. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 2855-2859.

PDF Ieee_Int_Sym_Int_The_2855_2017.pdf - Published Version Restricted to Registered users only Download (146kB) | Request a copy

Abstract

Multiple parties observe correlated data generated independently and identically (in time) from a known joint distribution. Parties communicate with each other interactively to enable each party to recover the data observed by all the other parties and attain omniscience. We characterize the asymptotic growth of the number of bits of interactive communication required by the parties to attain omniscience up to the second-order term. For the converse, we provide a single-shot lower hound for the required number of hits of communication, which yields the asymptotic result as a special case. It is shown that the knowledge of the distribution can be used to modify the recently proposed recursive data exchange protocol to render it optimal up to the second-order term. As a corollary, we provide a precise characterization of the reduction in communication for omniscience due to interaction.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for this article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	18 May 2018 15:59
Last Modified:	18 May 2018 15:59
URI:	http://eprints.iisc.ac.in/id/eprint/59905

Actions (login required)

View Item