Finite-length analysis of low-density parity-check codes on the binary erasure channel

DOI10.1109/TIT.2002.1003839zbMath1061.94081MaRDI QIDQ4674525

Changyan di, David Proietti, Emre Telatar, Thomas J. Richardson, Ruediger Urbanke

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Bounds on codes (94B65) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)

Related Items (18)

Loop series for discrete statistical models on graphs ⋮ On the complexity of and solutions to the minimum stopping and trapping set problems ⋮ Generic erasure correcting sets: bounds and constructions ⋮ On the stopping distance of LDPC codes based on symplectic space over finite fields ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Extremal absorbing sets in low-density parity-check codes ⋮ On sets without tangents and exterior sets of a conic ⋮ A library for formalization of linear error-correcting codes ⋮ Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation ⋮ LDPC codes from \(\mu\)-geodetic graphs obtained from block designs ⋮ On the minimum stopping sets of product codes ⋮ Geometrical organization of solutions to random linear Boolean equations ⋮ Generating Random Networks Without Short Cycles ⋮ Small stopping sets in Steiner triple systems ⋮ Effect of one redundant parity-check equation on the stopping distance ⋮ Analysis of Termatiko sets in measurement matrices ⋮ Absorbing sets of codes from finite geometries ⋮ Stopping sets of codes from complete graph

This page was built for publication: Finite-length analysis of low-density parity-check codes on the binary erasure channel