On the Hardness of Approximating Stopping and Trapping Sets

DOI10.1109/TIT.2010.2040941zbMath1366.94602MaRDI QIDQ5281524

Andrew McGregor, Olgica Milenković

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)