On the complexity of and solutions to the minimum stopping and trapping set problems
From MaRDI portal
Publication:2143118
DOI10.1016/j.tcs.2022.02.028OpenAlexW4214533197MaRDI QIDQ2143118
Alvaro Velasquez, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 31 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.028
Uses Software
Cites Work
- Note on Max Lin-2 above average
- Some APX-completeness results for cubic graphs
- Finding minimum stopping and trapping sets: an integer linear programming approach
- Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]
- Error Floor Approximation for LDPC Codes in the AWGN Channel
- On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes
- The intractability of computing the minimum distance of a code
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
- Finding All Small Error-Prone Substructures in LDPC Codes
- Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
- Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
- Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”
- A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
- On the Hardness of Approximating Stopping and Trapping Sets
- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
- Parameterized Algorithms
This page was built for publication: On the complexity of and solutions to the minimum stopping and trapping set problems
