Computing the Stopping Distance of a Tanner Graph Is NP-Hard

DOI10.1109/TIT.2007.896864MaRDI QIDQ3548264zbMATH OpenOpenAlexFDO

Authors

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2007.896864

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Decoding (94B35)

Recommendations

• Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
• The intractability of computing the minimum distance of a code
• Some new NP-complete coding problems
• Sur la complexité d'un problème de codage
• Finding minimum stopping and trapping sets: an integer linear programming approach

Cited in

(3)

• On the complexity of and solutions to the minimum stopping and trapping set problems
• On the minimum stopping sets of product codes
• Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs

This page was built for publication: Computing the Stopping Distance of a Tanner Graph Is NP-Hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548264)