{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:42:39Z","timestamp":1729662159680,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513639","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"819-823","source":"Crossref","is-referenced-by-count":6,"title":["New low-density parity-check codes with large girth based on hypergraphs"],"prefix":"10.1109","author":[{"given":"Irina E.","family":"Bocharova","sequence":"first","affiliation":[]},{"given":"Florian","family":"Hug","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Johannesson","sequence":"additional","affiliation":[]},{"given":"Boris D.","family":"Kudryashov","sequence":"additional","affiliation":[]},{"given":"Roman V.","family":"Satyukov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862120"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205685"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946009040061"},{"journal-title":"Graphs and Hypergraphs","year":"1976","author":"berge","key":"ref14"},{"key":"ref15","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","volume":"2","author":"hu","year":"0","journal-title":"Proc IEEE International Conference on Communications (ICC '04)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90006-5"},{"key":"ref18","first-page":"113","article-title":"Evaluation of Gallager codes for short block length and high rate applications","author":"mackay","year":"1999","journal-title":"Codes Systems and Graphical Models"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034787"},{"key":"ref6","article-title":"A [155, 64, 20] sparse graph (LDPC) code","author":"tanner","year":"2000","journal-title":"the Recent Results Session at IEEE International Symposium on Information Theory (ISIT'00)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref7","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"0","journal-title":"Proc ISTA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860415"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228102"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","article-title":"Quasi-cyclic low-density parity-check codes with girth larger than 12","volume":"53","author":"kim","year":"2007","journal-title":"IEEE Trans Inf Theory"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513639.pdf?arnumber=5513639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:53:32Z","timestamp":1497862412000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513639\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513639","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}