Fetching the paper…
Reading the bibliography…
This paper investigates the privacy amplification problem, and compares the existing two bounds: the exponential bound derived by one of the authors and the min-entropy bound derived by Renner.
C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, “Generalized privacy amplification,” IEEE Trans. Inform. Theory , vol. 41, no. 6, pp. 1915–1923, Nov. 1995
1995
Earlier work this paper cites.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications , 2nd ed. Springer, 1998
1998
Earlier work this paper cites.
T. S. Han, Information-Spectrum Methods in Information Theory . Springer, 2003
2003
Earlier work this paper cites.
R. Renner and S. Wolf, “Simple and tight bound for information reconciliation and privacy amplification,” in Advances in Cryptology – ASIACRYPT 2005 , ser. Lecture Notes in Computer Science, vol. 3788. Springer-Verlag, 2005, pp. 199–216
2005
Earlier work this paper cites.
M. Hayashi, “Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding,” Phys. Rev. A , vol. 76, no. 6, p. 062301, December 2007, arXiv:quant-ph/0611013
2007
Earlier work this paper cites.
R. Renner, “Security of quantum key distribution,” Ph.D. dissertation, Dipl. Phys. ETH, Switzerland, February 2005, arXiv:quant-ph/0512258, also available from International Journal of Quantum Information, vol. 6, no. 1, pp. 1–127, February 2008
2008
Cited alongside, same era.
M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,” IEEE Trans. Inform. Theory , vol. 55, no. 11, pp. 4947–4966, November 2009
2009
Cited alongside, same era.
N. Datta and R. Renner, “Smooth entropies and the quantum information spectrum,” IEEE Trans. Inform. Theory , vol. 55, no. 6, pp. 2807–2815, June 2009
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2010
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inform. Theory , vol. 57, no. 5, pp. 2307–2359, May 2010
2010
Cited alongside, same era.
Cited in the paper.
Cited in the paper.
2012
Closest in time.