{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:37:24Z","timestamp":1729661844380,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033993","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2398-2402","source":"Crossref","is-referenced-by-count":2,"title":["Capacity achieving LDPC ensembles for the TEP decoder in erasure channels."],"prefix":"10.1109","author":[{"given":"Pablo M.","family":"Olmos","sequence":"first","affiliation":[]},{"given":"Juan Jose","family":"Murillo-Fuentes","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Perez-Cruz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842571"},{"key":"ref11","article-title":"Tree-structure expectation propagation for LDPC decoding in erasure channels","author":"olmos","year":"2010","journal-title":"submitted to IEEE Trans on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.010311.102015"},{"key":"ref13","first-page":"5307","article-title":"Maxwell construction: the hidden bridge between iterative and maximum a posteriori decoding","volume":"54","author":"measson","year":"2008","journal-title":"IEEE Transactions on Information"},{"key":"ref14","article-title":"Capacity-achieving LDPC ensembles for BEC with less complexity using the TEP decoder","author":"olmos","year":"2011","journal-title":"Submitted to IEEE Transactions on Communications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low Density Parity Check Codes","author":"gallager","year":"1963"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883541"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033993.pdf?arnumber=6033993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:19:17Z","timestamp":1560730757000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033993\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033993","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}