31 citations · 56 across the 23 of their papers we have counts for
6 papers · 1 filter
Sparsifying Parity-Check Matrices
Luís M. S. Russo, Tobias Dietz, José Rui Figueira +2
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code…
A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding
Florian Gensheimer, Tobias Dietz, Kira Kraft +2
The Alternating Direction Method of Multipliers has recently been adapted for Linear Programming Decoding of Low-Density Parity-Check codes. The computation of the projection onto…
Efficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless Channels
Michael Helmling, Eirik Rosnes, Stefan Ruzika +1
In this work, we consider efficient maximum-likelihood decoding of linear block codes for small-to-moderate block lengths. The presented approach is a branch-and-bound algorithm us…
Towards An Exact Combinatorial Algorithm for LP Decoding of Turbo Codes
Michael Helmling, Stefan Ruzika
We present a novel algorithm that solves the turbo code LP decoding problem in a fininte number of steps by Euclidean distance minimizations, which in turn rely on repeated shortes…
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
Michael Helmling, Stefan Ruzika, Akin Tanatmis
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms bas…
A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher +3
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. relaxe…