On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation

On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation

We investigate the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation and show that their minimum distance is a sub-linear power function of the code length

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tillich, J.-P., Zemor, G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Bit error rate
Channel capacity
Encoding
Equations
Error correction codes
H infinity control
Iterative decoding
Parity check codes
Turbo codes
Turning
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation and show that their minimum distance is a sub-linear power function of the code length
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2006.262128