On the Hardness of Approximating Stopping and Trapping Sets

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

Olgica Milenković, Andrew McGregor

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the complexity of and solutions to the minimum stopping and trapping set problems

This page was built for publication: On the Hardness of Approximating Stopping and Trapping Sets