References

[1] 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.

[2] M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,” IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4947–4966, 2009.

[3] C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423 and 623–656, 1948.

[4] W. Yang, A. Collins, G. Durisi, Y. Polyanskiy, and H. V. Poor, “Beta-beta bounds: Finite-blocklength analog of the golden formula,” IEEE Trans. Inf. Theory, vol. 64, no. 9, pp. 6236–6256, Sep. 2018.

[5] A. Martinez and A. Guillén i Fàbregas, “Saddlepoint approximation of random–coding bounds.” San Diego, CA, U.S.A., Feb. 2011.

[6] R. G. Gallager, Information theory and reliable communication. New York, NY, U.S.A.: Wiley, 1968.

[7] J. Font-Segura, G. Vazquez-Vilar, A. Martinez, A. Guillén i Fàbregas, and A. Lancho, “Saddlepoint approximations of lower and upper bounds to the error probability in channel coding.” Princeton, NJ, Mar. 2018.

[8] Y. Polyanskiy and Y. Wu, Lecture notes on information theory. 2019.

[9] S. Verdú and T. S. Han, “A general formula for channel capacity,” IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147–1157, Jul. 1994.

[10] W. Feller, An introduction to probability theory and its applications, vol. II. New York, NY, USA: Wiley, 1971.

[11] M. C. Coşkun et al., “Efficient error-correcting codes in the short blocklength regime,” Physical Communication, Mar. 2019.