Pages that link to "Item:Q4973982"
From MaRDI portal
The following pages link to An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices (Q4973982):
Displaying 3 items.
- On the complexity of and solutions to the minimum stopping and trapping set problems (Q2143118) (← links)
- Effect of one redundant parity-check equation on the stopping distance (Q2317393) (← links)
- Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices” (Q5272157) (← links)
