Krishnan, Murali K and Shankar, Priti (2006) On the complexity of finding stopping set size in Tanner Graphs. In: 40th Annual Conference on Information Sciences and Systems (CISS),, Mar 22-24, 2006, Princeton, NJ, pp. 157-158.
04067794.pdf - Published Version
Restricted to Registered users only
Download (185Kb) | Request a copy
The problem of determining whether a Tanner graph for a linear block code has a stopping set of a given size is shown to be NT-complete.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||31 Aug 2010 08:48|
|Last Modified:||19 Sep 2010 06:12|
Actions (login required)