Pages that link to "Item:Q4974042"
From MaRDI portal
The following pages link to Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity (Q4974042):
Displaying 10 items.
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems (Q2052394) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Reweighted LP Decoding for LDPC Codes (Q2989791) (← links)
- An Impulse C Application in the LDPC Decoding Algorithm (Q3053407) (← links)
- Analysis of the iterative decoding of ldpc and product codes using the gaussian approximation (Q3547229) (← links)
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity (Q3548869) (← links)
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes (Q3604447) (← links)
- A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding (Q5124468) (← links)
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance (Q5272240) (← links)
- Efficient Implementation of Linear Programming Decoding (Q5272373) (← links)