2020 IEEE International Symposium on Information Theory, ISIT 2020, California, Amerika Birleşik Devletleri, 21 - 26 Temmuz 2020, ss.2149-2154
A strong converse bound for constant composition codes of the form P-e((n)) >= 1 - An(-0.5)(1-E-sc'(R, W, P))(e) - nE(sc)(R, W, P) is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mean, where A is a constant determined by the channel W, the composition p, and the rate R, i.e., A does not depend on the block length n.