Fetching the paper…
Reading the bibliography…
This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength.
C. E. Shannon, “Probability of error for optimal codes in a Gaussian channel,” Bell Syst. Tech. J. , vol. 38, no. 3, pp. 611–656, May 1959
1959
Earlier work this paper cites.
C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, “Lower bounds to error probability for coding on discrete memoryless channels i,” Inf. Contr. , vol. 10, pp. 65–103, 1967
1967
Earlier work this paper cites.
W. Feller, An Introduction to Probability Theory and Its Applications . New York, NY, USA: John Wiley & Sons, 1970, vol. 1
1970
Earlier work this paper cites.
A. D. Wyner, “The wiretap channel,” Bell Syst. Tech. J. , vol. 54, no. 8, pp. 1355–1367, Oct. 1975
1975
Earlier work this paper cites.
I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory , vol. 24, no. 3, pp. 339–348, May 1978
1978
Earlier work this paper cites.
S. K. Leung-Yan-Cheong and M. E. Hellman, “The Gaussian wire-tap channels,” IEEE Trans. Inf. Theory , vol. 24, no. 4, pp. 451–456, Jul. 1978
1978
Earlier work this paper cites.
L. Carter and M. Wegman, “Universal classes of hash functions,” J. Comput. Syst. Sci. , vol. 18, no. 2, pp. 143–154, 1979
1979
Earlier work this paper cites.
T. S. 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.
S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge, U.K.: Cambridge Univ. Press, 2004
2004
Earlier work this paper cites.
R. Renner, “Security of quantum key distribution,” Ph.D. dissertation, ETH, Zurich, Switzerland, Sep. 2005
2005
Earlier work this paper cites.
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, Apr. 2006
2006
Earlier work this paper cites.
A. Thangaraj, S. Dihidar, A. Calderbank, S. Mclaughlin, and J. M. Merolla, “Applications of LDPC codes to the wiretap channel,” IEEE Trans. Inf. Theory , vol. 53, no. 8, pp. 2933–2945, Aug. 2007
2007
Cited alongside, same era.
M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,” IEEE Trans. Inf. Theory , vol. 55, no. 11, pp. 4947–4966, Nov. 2009
2009
Cited alongside, same era.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2307–2359, May 2010
2010
Cited alongside, same era.
M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Trans. Inf. Theory , vol. 57, no. 6, pp. 3989–4001, Jun. 2011
2011
Cited alongside, same era.
W. K. Harrison, J. Almeida, M. R. Bloch, S. W. McLaughlin, and J. Barros, “Coding for secrecy: An overview of error-control coding techniques for physical-layer security,” IEEE Signal Process. Mag. , vol. 30, no. 5, pp. 41–50, Sep. 2013
2013
Later among the works it cites.
M. Hayashi, H. Tyagi, and S. Watanabe, “Strong converse for a degraded wiretap channel via active hypothesis testing,” in Proc. Allerton Conf. Commun., Contr., Comput. , Monticello, IL, USA, Sep. 2014, pp. 148–151
2014
Later among the works it cites.
2014
Later among the works it cites.
V. Y. F. Tan, “Asymptotic estimates in information theory with non-vanishing error probabilities,” in Foundations and Trends in Communications and Information Theory . Delft, The Netherlands: now Publishers, 2014, vol. 11, no. 1–2, pp. 1–184
2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems , 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2011
2011
Cited alongside, same era.
M. Bloch and J. Barros, Physical-Layer Security: from Information Theorey to Security Engineering . Cambridge, UK: Cambridge University Press, 2011
2011
Cited alongside, same era.
V. Y. F. Tan, “Achievable second-order coding rates for the wiretap channel,” in Proc. IEEE Int. Conf. Comm. Syst. (ICCS) , Singapore, Nov. 2012
2012
Cited alongside, same era.
M. Hayashi, “Tight exponential analysis of universally composable privacy amplification and its applications,” IEEE Trans. Inf. Theory , vol. 59, no. 11, Nov. 2013
2013
Cited alongside, same era.
M. H. Yassaee, M. R. Aref, and A. Gohari, “Non-asymptotic output statistics of random binning and its applications,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Istanbul, Turkey, Jul. 2013, pp. 1849–1853
2013
Cited alongside, same era.
S. Watanabe and M. Hayashi, “Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Istanbul, Turkey, Jul. 2013, pp. 2715–2719
2013
Cited alongside, same era.
Later among the works it cites.
M. B. Parizi and E. Telatar, “On the secrecy exponent of the wire-tap channel,” in Proc. IEEE Inf. Theory Workshop (ITW) , Jeju Island, Korea, Oct. 2015
2015
Later among the works it cites.
M. H. Yassaee, “One-shot achievability via fidelity,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Hong Kong, China, Jun. 2015
2015
Later among the works it cites.
2015
Later among the works it cites.
V. Y. F. Tan and M. Bloch, “Information spectrum approach to strong converse theorems for degraded wiretap channels,” IEEE Trans. Inf. Forensics Security , vol. 10, no. 9, pp. 1891–1904, Sep. 2015
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.