Tyagi, Himanshu and Viswanath, Pramod and Watanabe, Shun (2018) Interactive Communication for Data Exchange. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 64 (1). pp. 26-37.
PDF
Ieee_Tra_Inf_64-1_26_2018.pdf - Published Version Restricted to Registered users only Download (541kB) | Request a copy |
Abstract
Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for data exchange, which increases the communication size in steps until the task is done. We also derive a lower bound on the minimum number of bits that is based on relating the data exchange problem to the secret key agreement problem. Our single-shot analysis applies to all discrete random variables and yields upper and lower bounds of a similar form. In fact, the bounds are asymptotically tight and lead to a characterization of the optimal rate of communication needed for data exchange for a general source sequence, such as a mixture of independent and identically distributed (IID) random variables as well as the optimal second-order asymptotic term in the length of communication needed for data exchange for IID random variables, when the probability of error is fixed. This gives a precise characterization of the asymptotic reduction in the length of optimal communication due to interaction; in particular, two-sided Slepian-Wolf compression is strictly suboptimal.
Item Type: | Journal Article |
---|---|
Publication: | IEEE TRANSACTIONS ON INFORMATION THEORY |
Publisher: | 10.1109/TIT.2017.2769124 |
Additional Information: | Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA |
Department/Centre: | Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology) |
Date Deposited: | 20 Jan 2018 06:33 |
Last Modified: | 20 Jan 2018 06:33 |
URI: | http://eprints.iisc.ac.in/id/eprint/58816 |
Actions (login required)
View Item |