关于求Tanner图停止距离的复杂性
On the Complexity of finding Stopping Distance in Tanner Graphs
摘要:
两个与Tanner图中停集计算有关的判定问题被证明是NP-完全的。计算Tanner图的停止距离的问题的NP-困难性作为结果如下
英文摘要:
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。