Construction of protograph-based LDPC codes with chordless short cycles

Controlling small size trapping sets and short cycles can result in LDPC codes with large minimum distance $d_{\min}$. We prove that short cycles with a chord are the root of several trapping sets and eliminating these cycles increases $d_{\min}$. We show that the lower bounds on $d_{\min}$ of an LD...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Amirzade, Farzane, Mohammad-Reza~Sadeghi, Panario, Daniel
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Information Theory Mathematics - Information Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!