Publication

Optimal regular LDPC codes for the binary erasure channel

Mohammad Amin Shokrollahi
2005
Journal Articles

Abstract

We prove that for any given R between 0 and 1 the best threshold value for a regular LDPC code of rate R with common variable degree v and common check degree c occurs when v is at least 3 and is minimal subject to the condition $R=1-v/c$

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.

Mohammad Amin Shokrollahi
2005
Journal Articles

Abstract

Official source

Related publications (28)

Optimal regular LDPC codes for the binary erasure channel

Chat with Graph Search

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

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Symmetry in design and decoding of polar-like codes