K. Murali Krishnan 0001, Priti Shankar. On the Complexity of finding stopping set size in Tanner Graphs. In 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006. pages 157-158, IEEE, 2006. [doi]
No references recorded for this publication.
No citations of this publication recorded.