DocumentCode
2906704
Title
Numerical Comparison of IP Formulations as ML Decoders
Author
Tanatmis, Akin ; Ruzika, Stefan ; Punekar, Mayur ; Kienle, Frank
Author_Institution
Dept. of Math., Univ. of Kaiserslautern, Kaiserslautern, Germany
fYear
2010
fDate
23-27 May 2010
Firstpage
1
Lastpage
5
Abstract
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.
Keywords
BCH codes; binary codes; integer programming; linear codes; linear programming; maximum likelihood decoding; parity check codes; BCH codes; IP formulations; LDPC codes; binary linear codes; block length ML decoding; integer programming problem; linear programming decoding formulations; Bipartite graph; Communications Society; Kernel; Linear code; Linear programming; Mathematics; Maximum likelihood decoding; Microelectronics; Parity check codes; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (ICC), 2010 IEEE International Conference on
Conference_Location
Cape Town
ISSN
1550-3607
Print_ISBN
978-1-4244-6402-9
Type
conf
DOI
10.1109/ICC.2010.5502303
Filename
5502303
Link To Document