A Separation Algorithm for Improved LP-Decoding of Linear Block Codes

DOI10.1109/TIT.2010.2048489zbMATH Open1366.94763arXiv0812.2559OpenAlexW2140250923MaRDI QIDQ5281397FDOQ5281397

Authors: Akın Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Maximum Likelihood (ML) decoding is the optimal decoding algorithm for arbitrary linear block codes and can be written as an Integer Programming (IP) problem. Feldman et al. relaxed this IP problem and presented Linear Programming (LP) based decoding algorithm for linear block codes. In this paper, we propose a new IP formulation of the ML decoding problem and solve the IP with generic methods. The formulation uses indicator variables to detect violated parity checks. We derive Gomory cuts from our formulation and use them in a separation algorithm to find ML codewords. We further propose an efficient method of finding cuts induced by redundant parity checks (RPC). Under certain circumstances we can guarantee that these RPC cuts are valid and cut off the fractional optimal solutions of LP decoding. We demonstrate on two LDPC codes and one BCH code that our separation algorithm performs significantly better than LP decoding.

Full work available at URL: https://arxiv.org/abs/0812.2559

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cited In (7)

• An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem
• Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
• Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
• Title not available (Why is that?)
• A branch-cut-and-price algorithm for optimal decoding in digital communication systems
• On the complexity of and solutions to the minimum stopping and trapping set problems

This page was built for publication: A Separation Algorithm for Improved LP-Decoding of Linear Block Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281397)