{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:04:37Z","timestamp":1730232277247,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1109\/icc.2010.5502511","type":"proceedings-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T10:22:30Z","timestamp":1278930150000},"page":"1-5","source":"Crossref","is-referenced-by-count":7,"title":["Construction of Burst-Erasure Efficient LDPC Codes for Use with Belief Propagation Decoding"],"prefix":"10.1109","author":[{"given":"K.","family":"Li","sequence":"first","affiliation":[]},{"given":"A.","family":"Kavcic","sequence":"additional","affiliation":[]},{"given":"M. F.","family":"Erden","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595096"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WPMC.2002.1088325"},{"key":"ref14","article-title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inform Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.05.070047"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595166"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.080349"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2006.1618918"},{"key":"ref19","first-page":"35","article-title":"Greedy construction of LDPC codes for burst erasure channel","volume":"104","author":"wadayama","year":"2004","journal-title":"IEICE Tech Report"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/20.179611"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2004.826620"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090719"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/49.920174"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.03.060468"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261893"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/20.617425"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.186.0547"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref20"}],"event":{"name":"ICC 2010 - 2010 IEEE International Conference on Communications","start":{"date-parts":[[2010,5,23]]},"location":"Cape Town, South Africa","end":{"date-parts":[[2010,5,27]]}},"container-title":["2010 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5497983\/5501741\/05502511.pdf?arnumber=5502511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T19:24:39Z","timestamp":1489865079000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5502511\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icc.2010.5502511","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]}}}