{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:49Z","timestamp":1759638229152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961507"},{"type":"electronic","value":"9783319961514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96151-4_34","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T12:21:49Z","timestamp":1531830109000},"page":"402-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach"],"prefix":"10.1007","author":[{"given":"Alvaro","family":"Velasquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven L.","family":"Drager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"34_CR1","unstructured":"Richardson, T.: Error floors of LDPC codes. In: Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol. 41, pp. 1426\u20131435. The University; 1998 (2003)"},{"issue":"12","key":"34_CR2","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1109\/TCOMM.2007.910589","volume":"55","author":"H Xiao","year":"2007","unstructured":"Xiao, H., Banihashemi, A.H.: Estimation of bit and frame error rates of finite-length low-density parity-check codes on binary symmetric channels. IEEE Trans. Commun. 55(12), 2234\u20132239 (2007)","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C Di","year":"2002","unstructured":"Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inf. Theory 48(6), 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Krishnan, K.M., Shankar, P.: On the complexity of finding stopping set size in tanner graphs. In: 40th Annual Conference on Information Sciences and Systems, pp. 157\u2013158 (2006)","DOI":"10.1109\/CISS.2006.286453"},{"key":"34_CR5","unstructured":"Hu, X.-Y., Eleftheriou, E.: A probabilistic subspace approach to the minimal stopping set problem. In: 2006 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), pp. 1\u20136. VDE (2006)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Hirotomo, M., Konishi, Y., Morii, M.: On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes. In: IEEE International Symposium on Information Theory, ISIT 2008, pp. 295\u2013299. IEEE (2008)","DOI":"10.1109\/ISIT.2008.4594995"},{"issue":"9","key":"34_CR7","doi-asserted-by":"publisher","first-page":"4167","DOI":"10.1109\/TIT.2009.2025573","volume":"55","author":"E Rosnes","year":"2009","unstructured":"Rosnes, E., Ytrehus, \u00d8.: An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. IEEE Trans. Inf. Theory 55(9), 4167\u20134178 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Kyung, G.B., Wang, C.-C.: Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 739\u2013743. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513611"},{"key":"34_CR9","unstructured":"Rosenthal, J., Vontobel, P.O.: Construction of LDPC codes based on Ramanujan graphs and ideas from Margulis. In: Proceedings of 38th Annual Allerton Conference on Communication, Computing and Control, pp. 248\u2013257 (2000)"},{"issue":"4","key":"34_CR10","doi-asserted-by":"publisher","first-page":"1640","DOI":"10.1109\/TIT.2010.2040941","volume":"56","author":"A McGregor","year":"2010","unstructured":"McGregor, A., Milenkovic, O.: On the hardness of approximating stopping and trapping sets. IEEE Trans. Inf. Theory 56(4), 1640\u20131650 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"34_CR11","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1109\/TIT.2014.2334657","volume":"60","author":"M Karimi","year":"2014","unstructured":"Karimi, M., Banihashemi, A.H.: On characterization of elementary trapping sets of variable-regular LDPC codes. IEEE Trans. Inf. Theory 60(9), 5188\u20135203 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Hashemi, Y., Banihashemi, A.H.: Lower bounds on the size of smallest elementary and non-elementary trapping sets in variable-regular LDPC codes. In: IEEE Communications Letters (2017)","DOI":"10.1109\/LCOMM.2017.2707553"},{"key":"34_CR13","unstructured":"MacKay, D.J.C.: Encyclopedia of sparse graph codes (2005)"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11944836_9","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"KM Krishnan","year":"2006","unstructured":"Krishnan, K.M., Chandran, L.S.: Hardness of approximation results for the problem of finding the stopping distance in tanner graphs. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 69\u201380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_9"},{"issue":"11","key":"34_CR15","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.ipl.2010.04.010","volume":"110","author":"R Crowston","year":"2010","unstructured":"Crowston, R., Gutin, G., Jones, M.: Note on max lin-2 above average. Inf. Process. Lett. 110(11), 451\u2013454 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"34_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Wang, C.-C., Kulkarni, S.R., Poor, H.V.: Upper bounding the performance of arbitrary finite LDPC codes on binary erasure channels. In: 2006 IEEE International Symposium on Information Theory, pp. 411\u2013415. IEEE (2006)","DOI":"10.1109\/ISIT.2006.261701"},{"key":"34_CR18","unstructured":"Wang, C.-C., Kulkarni, S.R., Poor, H.V.: Exhausting error-prone patterns in LDPC codes. arXiv preprint arXiv:cs\/0609046 (2006)"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Wang, C.-C.: On the exhaustion and elimination of trapping sets: algorithms & the suppressing effect. In: IEEE International Symposium on Information Theory, ISIT 2007, pp. 2271\u20132275. IEEE (2007)","DOI":"10.1109\/ISIT.2007.4557558"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Karimi, M., Banihashemi, A.H.: An efficient algorithm for finding dominant trapping sets of irregular LDPC codes. In: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1091\u20131095. IEEE (2011)","DOI":"10.1109\/ISIT.2011.6033699"},{"key":"34_CR21","unstructured":"Koetter, R., Vontobel, P.O.: Graph-covers and iterative decoding of finite length codes. In: Proceedings of 3rd International Symposium on Turbo Codes and Related Topics, pp. 1\u20135 (2003)"},{"key":"34_CR22","unstructured":"Gurobi Optimization. Inc.: Gurobi optimizer reference manual (2014). http:\/\/www.gurobi.com"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96151-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T19:06:03Z","timestamp":1571598363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96151-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961507","9783319961514"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96151-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isco2018.lip6.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}