arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.03617cs.ITmath.IT
收藏

用于数据交换的交互式通信

Interactive Communication for Data Exchange

Himanshu Tyagi, Pramod Viswanath, Shun Watanabe

摘要:

观察相关数据的两方试图使用交互式通信来交换他们的数据。它们必须传递多少比特?我们提出了一个新的交互式协议的数据交换,增加通信规模的步骤,直到任务完成。接下来,我们推导出一个下界的最小位数的基础上有关的数据交换问题的秘密密钥协议问题。我们的单次分析适用于所有离散随机变量,并产生类似形式的上界和下界。事实上,边界是渐近紧的,并导致一个一般的序列,如混合物的IID随机变量的数据交换所需的通信的最佳速率的表征,以及最佳的二阶渐近项的IID随机变量的数据交换所需的通信的长度,当错误的概率是固定的。这给出了一个精确的表征的渐近减少的最佳通信的长度,由于相互作用,特别是,双边Slepian-Wolf压缩是严格的次优。

英文摘要:

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. Next, we 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 bound 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 sequence such as mixture of IID random variables as well as the optimal second-order asymptotic term in the length of communication needed for data exchange for the 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑