2020/02/29 by Hao-Chung Cheng, Barış Nakiboğlu, Baris Nakiboglu · 10 citations
Computer Science · Engineering · Mathematics · #Block (permutation group theory) #Cellular Automata and Applications #Channel (broadcasting) #Coding theory and cryptography #Composition (language) #Constant (computer programming) #Converse #Upper and lower bounds #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.1109/isit44484.2020.9174315
7 pages
openalex created_date 2020/03/06 · arxiv created 2020/05/13 · openalex publication_date 2020/06/01 · arxiv updated 2020/08/31 · openalex updated_date 2026/08/05
A strong converse bound for constant composition codes of the form P(n)e≥ 1-An-0.5(1-E0sc(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.