Publication

The Stability Condition of LDPC Codes Under MAP Decoding

Rüdiger Urbanke
2018
Conference Papers

Abstract

We determine the stability condition of low-density parity-check codes under both bitwise and blockwise maximum a posteriori decoding. As a consequence, we prove that the stability condition determines an upper bound on both the bitwise and the blockwise maximum a posteriori threshold.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The Stability Condition of LDPC Codes Under MAP Decoding

Chat with Graph Search

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Bridging Monte Carlo worlds: a new framework for accelerator simulations applied on shielding and machine protection studies

On Speed and Advantage : Results in Information Velocity and Monitoring Problems