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

DOI10.1109/TIT.2007.896864zbMath1323.68302OpenAlexW2115193201MaRDI QIDQ3548264

No author found.

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

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

Related Items (1)

On the minimum stopping sets of product codes

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