Fetching the paper…
Reading the bibliography…
Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the channel input.
C. Carathéodory, “Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen,” Rendiconti del Circolo Matematico di Palermo (1884 - 1940) , vol. 32, pp. 193–217, 1911, 10.1007/BF03014795. [Online]. Available: http://dx.doi.org/10.1007/BF03014795
1911
Earlier work this paper cites.
E. Steinitz, “Bedingt konvergente reihen und konvexe systeme,” J. Reine Angew. Math. , vol. 143, pp. 128–175, 1913
1913
Earlier work this paper cites.
H. Eggleston, Convexity . Cambridge University Press, 1963
1963
Earlier work this paper cites.
P. Gács and J. Körner, “Common information is far less than mutual information,” Problems of Control and Inf. Theory , vol. 2, pp. 149–162, 1973
1973
Earlier work this paper cites.
R. Gray and A. Wyner, “Source coding for a simple network,” Bell Systems Technical Journal , vol. 53, no. 9, pp. 1681–1721, Nov. 1974
1974
Earlier work this paper cites.
A. Wyner, “The common information of two dependent random variables,” IEEE Trans. Inf. Theory , vol. 21, no. 2, pp. 163–179, March 1975
1975
Earlier work this paper cites.
H. Witsenhausen, “Values and bounds for the common information of two discrete random variables,” SIAM Journal on Applied Mathematics , vol. 31, no. 2, pp. 313–333, 1976. [Online]. Available: http://epubs.siam.org/doi/abs/10.1137/0131026
1976
Earlier work this paper cites.
M. Salehi, “Cardinality bounds on auxiliary variables in multiple-user theory via the method of ahlswede and körner,” Technical Report, Stanford University , no. 33, Aug. 1978
1978
Earlier work this paper cites.
T. Han and S. Verdú, “Approximation theory of output statistics,” IEEE Trans. Inf. Theory , vol. 39, no. 3, pp. 752–772, May 1993
1993
Earlier work this paper cites.
U. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inf. Theory , vol. 39, no. 3, pp. 733–742, May 1993
1993
Earlier work this paper cites.
R. Ahlswede and I. Csiszár, “Common randomness in information theory and cryptography. i. secret sharing,” IEEE Trans. Inf. Theory , vol. 39, no. 4, pp. 1121–1132, July 1993
1993
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Channel simulation and coding with side information,” IEEE Trans. Inf. Theory , vol. 40, no. 3, pp. 634–646, May 1994
1994
Earlier work this paper cites.
I. Csiszár, “Generalized cutoff rates and Rényi’s information measures,” IEEE Trans. Inf. Theory , vol. 41, no. 1, pp. 26–34, 1995
1995
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Simulation of random processes and rate-distortion theory,” IEEE Trans. Inf. Theory , vol. 42, no. 1, pp. 63–86, Jan. 1996
1996
Earlier work this paper cites.
——, “Common randomness in information theory and cryptography. ii. cr capacity,” IEEE Trans. Inf. Theory , vol. 44, no. 1, pp. 225–240, Jan. 1998
1998
Earlier work this paper cites.
C. Bennett, P. Shor, J. Smolin, and A. Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,” Phys. Rev. Lett. , vol. 83, pp. 3081–3084, Oct. 1999. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.83.3081
1999
Earlier work this paper cites.
I. Csiszár and P. Narayan, “Common randomness and secret key generation with a helper,” IEEE Trans. Inf. Theory , vol. 46, no. 2, pp. 344–366, March 2000
2000
Earlier work this paper cites.
U. Maurer and S. Wolf, “Information-theoretic key agreement: From weak to strong secrecy for free,” in Advances in Cryptology EUROCRYPT 2000 , ser. Lecture Notes in Computer Science, B. Preneel, Ed. Springer Berlin / Heidelberg, 2000, vol. 1807, pp. 351–368
2000
Earlier work this paper cites.
C. Bennett, P. Shor, J. Smolin, and A. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem,” IEEE Trans. Inf. Theory , vol. 48, no. 10, pp. 2637–2655, Oct. 2002
2002
Cited alongside, same era.
E. Soljanin, “Compressing quantum mixed-state sources by sending classical information,” IEEE Trans. Inf. Theory , vol. 48, no. 8, pp. 2263–2275, 2002
2002
Cited alongside, same era.
A. Winter, “Compression of sources of probability distributions and density operators,” Aug. 2002, arXiv:quant-ph/0208131
2002
Cited alongside, same era.
R. Ahlswede and A. Winter, “Strong converse for identification via quantum channels,” IEEE Trans. Inf. Theory , vol. 48, no. 3, pp. 569–579, 2002
2002
Cited alongside, same era.
T. Han, Information-spectrum methods in information theory , ser. Applications of Mathematics. Springer, 2003, vol. 50
——, “Using a secret key to foil an eavesdropper,” in 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , Oct. 2010
2010
Later among the works it cites.
M. Berta, M. Christandl, and R. Renner, “The quantum reverse shannon theorem based on one-shot information theory,” Communications in Mathematical Physics , vol. 306, no. 3, pp. 579–615, 2011. [Online]. Available: http://dx.doi.org/10.1007/s00220-011-1309-7
2011
Later among the works it cites.
T. Cubitt, D. Leung, W. Matthews, and A. Winter, “Zero-error channel capacity and simulation assisted by non-local correlations,” IEEE Trans. Inf. Theory , vol. 57, no. 8, pp. 5509–5523, Aug. 2011
2011
Later among the works it cites.
A. Gohari and V. Anantharam, “Generating dependent random variables over networks,” in IEEE Information Theory Workshop (ITW) , Oct. 2011
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
——, “ Extrinsic
2004
Cited alongside, same era.
A. Winter, “Secret, public and quantum correlation cost of triples of random variables,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , Sept. 2005
2005
Cited alongside, same era.
T. Cover and J. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) . Wiley-Interscience, 2006
2006
Cited alongside, same era.
M. Hayashi, “General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1562–1575, 2006
2006
Cited alongside, same era.
V. Anantharam and V. Borkar, “Common randomness and distributed control: A counterexample,” Systems & Control Letters , vol. 56, no. 7-8, pp. 568–572, 2007. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0167691107000540
2007
Cited alongside, same era.
P. Harsha, R. Jain, D. McAllester, and J. Radhakrishnan, “The communication complexity of correlation,” in Twenty-Second Annual IEEE Conference on Computational Complexity (CCC) , June 2007
2007
Cited alongside, same era.
C. Bennett, I. Devetak, A. Harrow, P. Shor, and A. Winter, “Quantum reverse shannon theorem,” 2007, presentation: http://www.research.ibm.com/people/b/bennetc/QRSTonlineVersion.pdf
2007
Cited alongside, same era.
2011
Later among the works it cites.
M. Wilde, “From classical to quantum shannon theory,” 2011, arXiv:1106.1445
2011
Later among the works it cites.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems , 2nd ed. Cambridge University Press, 2011
2011
Later among the works it cites.
A. El Gamal and Y.-H. Kim, Network Information Theory . Cambridge University Press, 2011
2011
Later among the works it cites.
2012
Closest in time.
M. Wilde, P. Hayden, F. Buscemi, and M.-H. Hsieh, “The information-theoretic costs of simulating quantum measurements,” Journal of Physics A: Mathematical and Theoretical , vol. 45, no. 45, p. 453001, 2012. [Online]. Available: http://stacks.iop.org/1751-8121/45/i=45/a=453001
2012
Closest in time.
M. Yassaee, M. Aref, and A. Gohari, “Achievability proof via output statistics of random binning,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , July 2012
2012
Closest in time.
M. Yassaee, A. Gohari, and M. Aref, “Channel simulation via interactive communications,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , July 2012
2012
Closest in time.
F. Haddadpour, M. Yassaee, A. Gohari, and M. Aref, “Coordination via a relay,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , July 2012
2012
Closest in time.
C. Schieler and P. Cuff, “Secrecy is cheap if the adversary must reconstruct,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , July 2012
2012
Closest in time.
M. Bloch and J. Kliewer, “On secure communication with constrained randomization,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , July 2012
2012
Closest in time.
S. Satpathy and P. Cuff, “Secure cascade channel synthesis,” in IEEE Int’l. Symp. on Inf. Theory (ISIT) , July 2013
2013
Closest in time.
C. Schieler and P. Cuff, “A connection between good rate-distortion codes and backward dmcs,” in IEEE Information Theory Workshop (ITW) , Sept. 2013
2013
Closest in time.