Nakiboglu B.HAO-CHUNG CHENG2021-09-022021-09-02202021578095https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090415473&doi=10.1109%2fISIT44484.2020.9174315&partnerID=40&md5=e8400601eac249bc8a7ccc929964f9c2https://scholars.lib.ntu.edu.tw/handle/123456789/580535A strong converse bound for constant composition codes of the form Pe(n)?1 - An- 0.5(1 - E'sc (R,W,p)e - nEsc(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. ? 2020 IEEE.Information theory; Block lengths; Constant composition codes; Strong converse; Codes (symbols)[SDGs]SDG10conference paper10.1109/ISIT44484.2020.91743152-s2.0-85090415473