---
title: Sparse graph code
slug: sparse-graph-code
qid: 
snapshot: enwiki-001375543495
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1375543495
tags: [20548265, 23468805, 23603337, 26220375, 29176490, 32450103]
---

# Sparse graph code

> [!note] Provenance
> Snapshot `enwiki-001375543495` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1375543495> · Licensed CC BY-SA 4.0

A sparse graph code is a code which is represented by a sparse graph. Any linear code can be represented as a graph, where there are two sets of nodes - a set representing the transmitted bits and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical error-correcting codes are based on sparse graphs, achieving close to the Shannon limit. The archetypal sparse-graph codes are Gallager's low-density parity-check codes.

A sparse graph code is a code which is represented by a sparse graph. Any linear code can be represented as a graph, where there are two sets of nodes - a set representing the transmitted bits and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical error-correcting codes are based on sparse graphs, achieving close to the Shannon limit. The archetypal sparse-graph codes are Gallager's low-density parity-check codes. Iterative Error Correction: Turbo, Low-Density Parity-Check, and Repeat-Cccumulate Codes
