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]
@inproceedings{0001S06-2,
title = {On the Complexity of finding stopping set size in Tanner Graphs},
author = {K. Murali Krishnan 0001 and Priti Shankar},
year = {2006},
doi = {10.1109/CISS.2006.286453},
url = {https://doi.org/10.1109/CISS.2006.286453},
researchr = {https://researchr.org/publication/0001S06-2},
cites = {0},
citedby = {0},
pages = {157-158},
booktitle = {40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006},
publisher = {IEEE},
isbn = {1-4244-0349-9},
}