Communication for Generating Correlation: A Unifying Survey

被引:26
作者
Sudan, Madhu [1 ]
Tyagi, Himanshu [2 ]
Watanabe, Shun [3 ]
机构
[1] Harvard Univ, John A Paulson Sch Engn & Appl Sci, Cambridge, MA 02138 USA
[2] Indian Inst Sci, Dept Elect Commun Engn, Bengaluru 560012, India
[3] Tokyo Univ Agr & Technol, Dept Comp & Informat Sci, Tokyo 1848588, Japan
基金
日本学术振兴会;
关键词
Random variables; Information theory; Correlation; Couplings; Task analysis; Computer science; Protocols; Common randomness; secret key generation; channel simulation; correlation generation; interactive communication; SECRET KEY AGREEMENT; COMMON RANDOMNESS CAPACITY; PRIVACY AMPLIFICATION; SIDE INFORMATION; CHANNEL SIMULATION; FUZZY EXTRACTORS; NOISE STABILITY; RANDOM BITS; IDENTIFICATION; CRYPTOGRAPHY;
D O I
10.1109/TIT.2019.2946364
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The task of manipulating correlated random variables in a distributed setting has received attention in the fields of both Information Theory and Computer Science. Often shared correlations can be converted, using a little amount of communication, into perfectly shared uniform random variables. Such perfect shared randomness, in turn, enables the solutions of many tasks. Even the reverse conversion of perfectly shared uniform randomness into variables with a desired form of correlation turns out to be insightful and technically useful. In this article, we describe progress-to-date on such problems and lay out pertinent measures, achievability results, limits of performance, and point to new directions.
引用
收藏
页码:5 / 37
页数:33
相关论文
共 192 条
[1]   IDENTIFICATION VIA CHANNELS [J].
AHLSWEDE, R ;
DUECK, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) :15-29
[2]   SPREADING OF SETS IN PRODUCT SPACES AND HYPERCONTRACTION OF MARKOV OPERATOR [J].
AHLSWEDE, R ;
GACS, P .
ANNALS OF PROBABILITY, 1976, 4 (06) :925-939
[3]   ELIMINATION OF CORRELATION IN RANDOM CODES FOR ARBITRARILY VARYING CHANNELS [J].
AHLSWEDE, R .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1978, 44 (02) :159-175
[4]   Common randomness in information theory and cryptography - Part II: CR capacity [J].
Ahlswede, R ;
Csiszar, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :225-240
[5]   COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].
AHLSWEDE, R ;
CSISZAR, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132
[6]   SOURCE CODING WITH SIDE INFORMATION AND A CONVERSE FOR DEGRADED BROADCAST CHANNELS [J].
AHLSWEDE, RF ;
KORNER, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (06) :629-637
[7]   Common randomness and distributed control: A counterexample [J].
Anantharam, Venkat ;
Borkar, Vivek .
SYSTEMS & CONTROL LETTERS, 2007, 56 (7-8) :568-572
[8]  
[Anonymous], 2006, Elements of information theory
[9]  
[Anonymous], 2008, ARXIV08053200
[10]  
[Anonymous], [No title captured]