Name
Abstract | ||
|---|---|---|
We study an integer programming (IP) based separation approach to find the maximum likelihood (ML) codeword for binary linear codes. An algorithm introduced in Tanatmis et al. is extended and improved with respect to decoding performance without increasing the worst case complexity. This is demonstrated on the LDPC and the BCH code classes. Moreover, we propose an integer programming formulation to calculate the minimum distance of a binary linear code. We exemplarily compute the minimum distance of the (204, 102) LDPC code and the (576, 288) WIMAX code. Using the minimum distance of a code, a new class of valid inequalities is introduced. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISIT.2009.5205846 | Seoul |
Keywords | Field | DocType |
minimum distance,decoding performance,wimax code,maximum likelihood,integer programming formulation,integer programming,binary linear code,bch code class,valid inequality,new class,ldpc code,indexes,linear programming,binary codes,decoding,bch codes,bch code,linear code | Discrete mathematics,Concatenated error correction code,Combinatorics,Constant-weight code,Parity-check matrix,Low-density parity-check code,Polynomial code,Cyclic code,Code word,Linear code,Mathematics | Conference |
ISBN | Citations | PageRank |
978-1-4244-4313-0 | 5 | 0.46 |
References | Authors | |
8 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akin Tanatmis | 1 | 5 | 0.46 |
| Stefan Ruzika | 2 | 174 | 21.91 |
| Horst W. Hamacher | 3 | 562 | 57.39 |
| Mayur Punekar | 4 | 10 | 1.22 |
| Frank Kienle | 5 | 186 | 17.11 |
| Norbert Wehn | 6 | 1165 | 137.17 |