On the complexity of finding stopping set size in Tanner Graphs
| Data(s) |
2006
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/30473/1/04067794.pdf 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. |
| Publicador |
IEEE |
| Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4067794&tag=1 http://eprints.iisc.ernet.in/30473/ |
| Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
| Tipo |
Conference Paper PeerReviewed |
