Strong Converse and Second-Order Asymptotics of Channel Resolvability

V. Strassen, “Asymptotische Abschätzungen in Shannons Informationstheorie,” in Trans. Third. Prague Conf. Inf. Th. , 1962, pp. 689–723

1962

Earlier work this paper cites.

A. D. Wyner, “The common information of two dependent random variables,” IEEE Trans. Inform. Theory , vol. 21, no. 2, pp. 163–179, March 1975

1975

Earlier work this paper cites.

T. S. Han and S. Verdú, “Approximation theory of output statistics,” IEEE Trans. Inform. Theory , vol. 39, no. 3, pp. 752–772, May 1993

1993

Earlier work this paper cites.

T. S. Han and S. Verdú, “Spectrum invariancy under output approximation for full-rank discrete memoryless channels,” Problemy Peredachi Informatsii , vol. 29, no. 2, pp. 9–27, 1993

1993

Earlier work this paper cites.

I. Csiszár, “Almost independence and secrecy capacity,” Problems of Information Transmission , vol. 32, no. 1, pp. 40–47, 1996

1996

Earlier work this paper cites.

Y. Steinberg, “New converses in the theory of identification via channels,” IEEE Trans. Inform. Theory , vol. 44, no. 3, pp. 984–998, May 1998

1998

Earlier work this paper cites.

R. Ahlswede and A. Winter, “Strong converse for identification via quantum channels,” IEEE Trans. Inform. Theory , vol. 48, no. 3, pp. 569–579, March 2002

2002

Earlier work this paper cites.

C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,” IEEE Trans. Inform. Theory , vol. 48, no. 10, pp. 2637–2655, October 2002

2002

Earlier work this paper cites.

A. Winter, “Compression of sources of probability distributions and density operators,” 2002, arXiv:quant-ph/0208131

2002

Earlier work this paper cites.

T. S. Han, Information-Spectrum Methods in Information Theory . Springer, 2003

2003

Cited alongside, same era.

N. Cai, A. Winter, and R. W. Yeung, “Quantum privacy and quantum wiretap channels,” Problems of Information Transmission , vol. 40, no. 4, pp. 26–47, 2004

2004

Cited alongside, same era.

S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2004

2004

Cited alongside, same era.

I. Devetak, “The private classical capacity and quantum capacity of a quantum channel,” IEEE Trans. Inform. Theory , vol. 51, no. 1, pp. 44–55, January 2005, arXiv:quant-ph/0304127

2005

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. Inform. Theory , vol. 52, no. 4, pp. 1562–1575, April 2006

2006

Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inform. Theory , vol. 56, no. 5, pp. 2307–2359, May 2010

2010

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.

Y. Oohama, “Converse coding theorems for identification via channels,” IEEE Trans. Inform. Theory , vol. 59, no. 2, pp. 744–759, February 2013

2013

Later among the works it cites.

M. Bloch and J. N. Laneman, “Strong secrecy from channel resolvability,” IEEE Trans. Inform. Theory , vol. 59, no. 12, pp. 8077–8098, December 2013

2013

Later among the works it cites.

N. Datta, M. H. Hsieh, and M. M. Wilde, “Quantum rate distortion, reverse Shannon theorem, and source-channel separation,” IEEE Trans. Inform. Theory , vol. 59, no. 1, pp. 615–630, January 2013