On the Complexity of finding Stopping Distance in Tanner Graphs

Simple item page
dc.creatorKrishnan, K. Murali
dc.creatorShankar, Priti
dc.date2005-12-28
dc.date2006-05-29
dc.date.accessioned2026-07-07T09:51:35Z
dc.date.available2026-07-07T09:51:35Z
dc.descriptionTwo 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
dc.descriptionA decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs. Now corrected
dc.identifierhttps://arxiv.org/abs/cs/0512101
dc.identifierhttp://arxiv.org/abs/cs/0512101
dc.identifierIEEE Trans. Info. Theory, 53(6), 2007, pp. 2278-2280.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165295
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.titleOn the Complexity of finding Stopping Distance in Tanner Graphs
dc.typetext

Files

Collections

arXiv