1. Nakiboğlu, B., The Augustin Center and the Sphere Packing Bound for Memoryless Channels, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT’2017), Aachen, Germany, June 25–30, 2017, pp. 1401–1405.
2. Elias, P., Coding for Noisy Channels, IRE Conv. Rec., 1955, vol. 4, pp. 37–46. Reprinted in Key Papers in the Development of Information Theory, Slepian, D., Ed., New York: IEEE Press, 1974, pp. 102–111.
3. Elias, P., Coding for Two Noisy Channels, Information Theory: Third London Symposium (London, England, Sept. 1955), Cherry C., Ed., London: Butterworth Sci., 1956, pp. 61–74.
4. Dobrushin, R.L.Asymptotic Estimates of the Probability of Error for Transmission of Messages over a Discrete Memoryless Communication Channel with a Symmetric Transition Probability Matrix, Teor. Veroyatn. Primen., 1962, vol. 7, no. 3, pp. 283–311 [Theory Probab. Appl. (Engl. Transl.), 1962, vol. 7, no. 3, pp. 270–300].
5. Altuğ, Y. and Wagner, A.B., On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels, arXiv:1908.11419[cs.IT], 2019.