2013/03/03 by Enhui Yang, Jin Meng, Yang, En-hui +1
Computer Science · Engineering · #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1303.0572
openalex publication_date 2013/03/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
New non-asymptotic random coding theorems (with error probability ε and finite block length n) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input arbitrary output channels. The resulting non-asymptotic achievability bounds, when combined with non-asymptotic equipartition properties developed in the paper, can be easily computed. Analytically, these non-asymptotic achievability bounds are shown to be asymptotically tight up to the second order of the coding rate as n goes to infinity with either constant or sub-exponentially decreasing ε. Numerically, they are also compared favourably, for finite n and ε of practical interest, with existing non-asymptotic achievability bounds in the literature in general.