2023/05/16 by Ioannis Papoutsidakis, Papoutsidakis, Ioannis, Angela Doufexi +3
Computer Science · Engineering · #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2305.09450
openalex publication_date 2023/05/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation time, this bound is evaluated in polynomial time. This improvement in complexity is also attainable for the original random coding bound that utilizes an information density decoder. The general bound is particularized for the binary symmetric channel, the binary erasure channel, and the Gaussian channel.