{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T01:58:41Z","timestamp":1725415121576},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1109\/isita.2010.5649581","type":"proceedings-article","created":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T22:53:11Z","timestamp":1292021591000},"page":"861-866","source":"Crossref","is-referenced-by-count":6,"title":["Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel"],"prefix":"10.1109","author":[{"given":"Mathieu","family":"Cunche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Savin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Roca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5426098"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261768"},{"key":"ref12","article-title":"Random matrices and codes for the erasure channel","author":"studholme","year":"2008","journal-title":"Algorithmica"},{"key":"ref13","first-page":"249","article-title":"On quasi-cyclic repeat-accumulate codes","author":"michael tanner","year":"1999","journal-title":"Proc 37th Allerton Conf Communication Control and Computing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref3","article-title":"Coding theorems for “turbo-like” codes","author":"divsalar","year":"1998","journal-title":"Proceedings Thirty-Sixth Annual Allerton Conference on Communication Control and Computing"},{"key":"ref6","article-title":"Improving the Decoding of LDPC Codes for the Packet Erasure Channel with a Hybrid Zyablov Iterative Decoding\/Gaussian Elimination Scheme","author":"cunche","year":"2008","journal-title":"INRIA Research Report RR-6473"},{"key":"ref5","first-page":"109","article-title":"Solving large sparse linear systems over finite fields","author":"brian","year":"1991","journal-title":"CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology"},{"journal-title":"Low-complexity ldpc codes with near-optimum performance over the bec","year":"2008","author":"paolini","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080221"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SPSC.2008.4686723"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836694"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"}],"event":{"name":"Its Applications (Isita2010)","start":{"date-parts":[[2010,10,17]]},"location":"Taichung, Taiwan","end":{"date-parts":[[2010,10,20]]}},"container-title":["2010 International Symposium On Information Theory & Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5640322\/5648872\/05649581.pdf?arnumber=5649581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T06:16:57Z","timestamp":1490077017000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5649581\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isita.2010.5649581","relation":{},"subject":[],"published":{"date-parts":[[2010,10]]}}}