Valid inequalities for binary linear codes

Autor:	Norbert Wehn, Stefan Ruzika, Frank Kienle, Horst W. Hamacher, Mayur Punekar, Akin Tanatmis
Rok vydání:	2009
Předmět:	Discrete mathematics Parity-check matrix Polynomial code Cyclic code Concatenated error correction code Code word Data_CODINGANDINFORMATIONTHEORY Constant-weight code Low-density parity-check code Linear code Computer Science::Information Theory Mathematics
Zdroj:	ISIT
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::23a2e8623c0ddad853af034c8eb21e17 https://doi.org/10.1109/isit.2009.5205846 Zobrazit plný text záznamu