Publication

Weight Distribution of Low-Density Parity-Check Codes

Rüdiger Urbanke, Changyan Di
2006
Journal Articles

Abstract

We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns out that capacity-achieving sequences of standard (unstructured) LDPC codes under iterative decoding over the binary erasure channel (BEC) known to date have sublinearly growing minimum distance in the block length.

Official source

https://infoscience.epfl.ch/entities/publication/c23e7bde-fe8d-420a-9bcd-7201b36cc975

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.

Weight Distribution of Low-Density Parity-Check Codes

Chat with Graph Search

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

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

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes