Numerical Comparison of IP Formulations as ML Decoders

Numerical Comparison of IP Formulations as ML Decoders

For binary linear codes with short and medium block length ML decoding can be achieved by solving the associated integer programming (IP) problem with a general purpose solver. IP also offers algorithms for computing the minimum distance. In this article, we present several IP formulations and compu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tanatmis, A, Ruzika, S, Punekar, M, Kienle, F
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Bipartite graph
Communications Society
Kernel
Linear code
Linear programming
Mathematics
Maximum likelihood decoding
Microelectronics
Parity check codes
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For binary linear codes with short and medium block length ML decoding can be achieved by solving the associated integer programming (IP) problem with a general purpose solver. IP also offers algorithms for computing the minimum distance. In this article, we present several IP formulations and computationally compare them on various LDPC and BCH codes. Most of these formulations are obtained by forcing integrality on linear programming (LP) decoding formulations proposed in the literature.
ISSN:1550-3607
1938-1883
DOI:10.1109/ICC.2010.5502303