By Topic

On the Complexity of finding stopping set size in Tanner Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Krishnan, K.Murali ; Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore ; Shankar, P.

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 NP-complete.

Published in:

Information Sciences and Systems, 2006 40th Annual Conference on

Date of Conference:

22-24 March 2006