Performance of the Bounded Distance Decoder on the AWGN Channel

2012/07/24 by K. Andrews, Kenneth Andrews, Andrews, Kenneth +2
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1207.5850

International Symposium on Information Theory (ISIT), July 2012, Recent Results session, 2 pages

arxiv created 2012/07/24 · openalex publication_date 2012/07/24 · arxiv updated 2012/07/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total word error rate, Pw, and the undetected error rate, Pu. Excellent agreement is found with simulation results for a small code, and the bounds are shown to be tractable for a larger code.

Related

• Upper Bounds On the ML Decoding Error Probability of General Codes over AWGN Channels
• Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance
• On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum Rank Distance Codes
• Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
• On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel