{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:27:51Z","timestamp":1729621671668,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595166","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:33:52Z","timestamp":1218666832000},"page":"1143-1147","source":"Crossref","is-referenced-by-count":7,"title":["Optimizing burst erasure correction of LDPC codes by interleaving"],"prefix":"10.1109","author":[{"given":"Gokul","family":"Sridharan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abishek","family":"Kumarasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Thangaraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikrishna","family":"Bhashyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Numerical methods in Computing","year":"1992","author":"press","key":"17"},{"year":"0","key":"18"},{"key":"15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851753"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2006.302313"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2006.1618918"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2003.808600"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2004.824125"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557391"},{"key":"6","article-title":"performance of low-density parity-check codes for burst erasure channels","author":"hosoya","year":"0","journal-title":"Int Symp on Info Th and its App ISITA2006 Nov-2006"},{"key":"5","first-page":"184","article-title":"ldpc codes for the classic bursty channel","author":"johnson","year":"2004","journal-title":"International Symposium of Information Theory and its Applications (ISITA'04)"},{"key":"4","article-title":"finite-length analysis of low-density parity-check codes on the binary erasure channel","author":"di","year":"2002","journal-title":"IEEE Trans on Info Th"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323762"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254908"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595166.pdf?arnumber=4595166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T10:55:40Z","timestamp":1497783340000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595166\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595166","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}