Using Linear Programming to Decode Binary Linear Codes
From MaRDI portal
Publication:3546868
DOI10.1109/TIT.2004.842696zbMath1234.94086WikidataQ56883088 ScholiaQ56883088MaRDI QIDQ3546868
Martin J. Wainwright, Jon Feldman, David R. Karger
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Characterizations of pseudo-codewords of (low-density) parity-check codes, New Results on the Pseudoredundancy, Decoding turbo-like codes via linear programming, Hierarchical Models, Marginal Polytopes, and Linear Codes, Extremal absorbing sets in low-density parity-check codes, Monotonic optimization based decoding for linear codes, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory, Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions, Unnamed Item, Certifying Polynomial Nonnegativity via Hyperbolic Optimization, Pseudocodeword-free criterion for codes with cycle-free Tanner graph, A branch-cut-and-price algorithm for optimal decoding in digital communication systems, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Absorbing sets of codes from finite geometries, Unnamed Item, Trellis complexity and pseudoredundancy of relative two-weight codes
