{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:28:30Z","timestamp":1725870510461},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319387871"},{"type":"electronic","value":"9783319387895"}],"license":[{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-38789-5_23","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T10:54:56Z","timestamp":1478602496000},"page":"131-137","source":"Crossref","is-referenced-by-count":0,"title":["Design and Analysis of Efficient Algorithm for Counting and Enumerating Cycles in LDPC Codes"],"prefix":"10.1007","author":[{"given":"Kongzhe","family":"Yang","sequence":"first","affiliation":[]},{"given":"Bangning","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Zhan","sequence":"additional","affiliation":[]},{"given":"Daoxing","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"23_CR1","first-page":"41","volume":"1","author":"Y Mao","year":"2001","unstructured":"Mao Y, Banihashemi AH (2001) A heuristic search for good low-density parity-check codes at short block lengths. Proc IEEE Int Conf Commun 1:41\u201344","journal-title":"Proc IEEE Int Conf Commun"},{"key":"23_CR2","first-page":"995","volume":"1","author":"X-Y Hu","year":"2001","unstructured":"Hu X-Y, Eleftheriou E, Arnold D-M (2001) Progressive edge-growth Tanner graphs. Proc IEEE Global Telecommun Conf 1:995\u20131001","journal-title":"Proc IEEE Global Telecommun Conf"},{"issue":"11","key":"23_CR3","doi-asserted-by":"crossref","first-page":"6942","DOI":"10.1109\/TIT.2012.2205663","volume":"58","author":"M Karimi","year":"2012","unstructured":"Karimi M, Banihashemi AH (2012) Efficient algorithm for finding dominant trapping sets of LDPC codes. IEEE Trans Inf Theory 58(11):6942\u20136958","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"23_CR4","doi-asserted-by":"crossref","first-page":"1550","DOI":"10.1109\/TCOMM.2009.06.070048","volume":"57","author":"H Xiao","year":"2009","unstructured":"Xiao H, Banihashemi AH (2009) Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration. IEEE Trans Commun 57(6):1550\u20131555","journal-title":"IEEE Trans Commun"},{"issue":"4","key":"23_CR5","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TIT.2011.2110150","volume":"57","author":"R Asvadi","year":"2011","unstructured":"Asvadi R, Banihashemi AH, Ahmadian-Attari M (2011) Lowering the error floor of LDPC codes using cyclic liftings. IEEE Trans Inf Theory 57(4):2213\u20132224","journal-title":"IEEE Trans Inf Theory"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/SFCS.2002.1181978","volume":"1","author":"J Flum","year":"2002","unstructured":"Flum J, Grohe M (2002) The parameterized complexity of counting problems. Proc IEEE Symp Found Comput Sci 1:538\u2013547","journal-title":"Proc IEEE Symp Found Comput Sci"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R Tarjan","year":"1973","unstructured":"Tarjan R (1973) Enumeration of the elementary circuits of a directed graph. J SIAM 2:211\u2013216","journal-title":"J SIAM"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson DB (1975) Find all the elementary circuits of a directed graph. J SIAM 4:77\u201384","journal-title":"J SIAM"},{"key":"23_CR9","unstructured":"Liu H, Wang J (2006) A new way to enumerate cycles in graph. In: Proceedings of the advanced international conference on telecommunications and international conference on internet and web applications and services (AICT\/ICIW 2006)"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(94)00151-0","volume":"52","author":"ET Bax","year":"1994","unstructured":"Bax ET (1994) Algorithms to count paths and cycles. Inf Process Lett 52:249\u2013252","journal-title":"Inf Process Lett"},{"issue":"3","key":"23_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17(3):209\u2013223","journal-title":"Algorithmica"},{"key":"23_CR12","first-page":"2183","volume":"3","author":"J Fan","year":"2006","unstructured":"Fan J, Xiao Y (2006) A method of counting the number of cycles in LDPC codes. Proc Int Conf Signal Process 3:2183\u20132186","journal-title":"Proc Int Conf Signal Process"},{"issue":"8","key":"23_CR13","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1109\/LCOMM.2007.07613","volume":"11","author":"R Chen","year":"2007","unstructured":"Chen R, Huang H, Xiao G (2007) Relation between parity-check matrices and cycles of as-sociated Tanner graphs. IEEE Commun Lett 11(8):674\u2013676","journal-title":"IEEE Commun Lett"},{"issue":"1","key":"23_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TIT.2005.860472","volume":"52","author":"TR Halford","year":"2006","unstructured":"Halford TR, Chugg KM (2006) An algorithm for counting short cycles in bipartite graphs. IEEE Trans Inf Theory 52(1):287\u2013292","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"23_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/TCOMM.2012.100912.120503","volume":"61","author":"M Karimi","year":"2013","unstructured":"Karimi M, Banihashemi AH (2013) Message-passing algorithms for counting short cycles in a graph. IEEE Trans Commun 61(2):485\u2013495","journal-title":"IEEE Trans Commun"},{"key":"23_CR16","unstructured":"D. MacKay\u2019s Gallager Code Resources [Online]. http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/"}],"container-title":["Advances in Intelligent Systems and Computing","Information Technology and Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38789-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:03:52Z","timestamp":1498359832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38789-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,9]]},"ISBN":["9783319387871","9783319387895"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38789-5_23","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016,11,9]]}}}