Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
From MaRDI portal
Recommendations
- Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity
- Using linear programming to decode LDPC codes
- Multistep linear programming approaches for decoding low-density parity-check codes
- Iterative decoding of LDPC codes: some bounds and properties
- Decoding low-dimensional linear codes by linear programming
- Linear-Programming Decoding of Nonbinary Linear Codes
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
- Efficient Implementation of Linear Programming Decoding
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Cited in
(10)- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Reweighted LP Decoding for LDPC Codes
- An Impulse C Application in the LDPC Decoding Algorithm
- Analysis of the iterative decoding of ldpc and product codes using the gaussian approximation
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
- A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
- Efficient Implementation of Linear Programming Decoding
This page was built for publication: Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974042)
