Pages that link to "Item:Q2989459"
From MaRDI portal
The following pages link to Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity (Q2989459):
Displaying 5 items.
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes (Q3604447) (← links)
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity (Q4974042) (← 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)