Using Linear Programming to Decode Binary Linear Codes
From MaRDI portal
Recommendations
Cited in
(33)- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- Monotonic optimization based decoding for linear codes
- 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
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Absorbing sets of codes from finite geometries
- Characterizations of pseudo-codewords of (low-density) parity-check codes
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- Trellis complexity and pseudoredundancy of relative two-weight codes
- LP decoding achieves capacity
- Using linear programming to decode LDPC codes
- Multistep linear programming approaches for decoding low-density parity-check codes
- Linear programming-based optimization of the distance spectrum of linear block codes
- Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding
- LP Decoding Corrects a Constant Fraction of Errors
- Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
- A New Linear Programming Approach to Decoding Linear Block Codes
- Adaptive Methods for Linear Programming Decoding
- Hierarchical Models, Marginal Polytopes, and Linear Codes
- Decoding low-dimensional linear codes by linear programming
- On linear programming decoding on a quantized additive white Gaussian noise channel
- Dynamic programming and the graphical representation of error-correcting codes
- Fast MCMC sampling algorithms on polytopes
- Hinge-loss Markov random fields and probabilistic soft logic
- New results on the pseudoredundancy
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization
- Analog Product Codes Decodable by Linear Programming
- Decoding turbo-like codes via linear programming
- Extremal absorbing sets in low-density parity-check codes
- Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
- Cardinality minimization, constraints, and regularization: a survey
- Weight distributions of two classes of optimal (r, )-locally repairable codes
- Novel matrix hit and run for sampling polytopes and its GPU implementation
This page was built for publication: Using Linear Programming to Decode Binary Linear Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546868)
