Title :
On the Complexity of finding stopping set size in Tanner Graphs
Author :
Krishnan, K.Murali ; Shankar, Priti
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore
Abstract :
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.
Keywords :
block codes; graph theory; linear codes; linear block code; stopping set size; tanner graph; Automation; Bipartite graph; Computer science; Failure analysis; Iterative algorithms; Iterative decoding; Linear code; NP-complete problem; Parity check codes;
Conference_Titel :
Information Sciences and Systems, 2006 40th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
1-4244-0349-9
Electronic_ISBN :
1-4244-0350-2
DOI :
10.1109/CISS.2006.286453
