Apr 2, 2012 · In this paper we draw on decomposition methods from optimization theory, specifically the Alternating Directions Method of Multipliers (ADMM), ...
Abstract—When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum like- lihood decoding problem can be ...
In this paper we draw upon large-scale decomposition methods from convex optimization to develop an efficient, scalable algorithm for LP decoding. The result is ...
In this paper we draw on decomposition methods from optimization theory to develop efficient distributed algorithms for LP decoding. The key enabling technical ...
Abstract. Feldman et al. (IEEE Trans. Inform. Theory, Mar. 2005) showed that linear programming. (LP) can be used to decode linear error correcting codes.
Sep 23, 2013 · Abstract. When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding ...
This paper draws on decomposition methods from optimization theory, specifically the alternating direction method of multipliers (ADMM), ...
BP has been empirically successful in decoding LDPC codes but possess are no convergence guarantees. Inherently distributed and takes full advantage of ...
The key enabling technical result is a nearly linear time algorithm for two-norm projection onto the parity polytope that allows us to use LP decoding, ...
Aug 13, 2018 · Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht: Decomposition Methods for Large Scale LP Decoding. CoRR abs/1204.0556 (2012).