{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:44:05Z","timestamp":1730274245348,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595128","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:33:52Z","timestamp":1218666832000},"page":"955-959","source":"Crossref","is-referenced-by-count":2,"title":["Split non-binary LDPC codes"],"prefix":"10.1109","author":[{"given":"Adrian","family":"Voicila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Declercq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francois","family":"Verdier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Fossorier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Urard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261681"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19970362"},{"key":"7","first-page":"772","article-title":"log-domain decoding of ldpc codes over gf(q)","author":"wyrneersch","year":"2004","journal-title":"The Proc IEEE Intern Conf Commun"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312545"},{"key":"4","article-title":"progressive edge-growth tanner graphs","author":"hu","year":"2001","journal-title":"Proc Globecom"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"11","first-page":"767","article-title":"on the computation of the minimum distance of low-density parity-check codes","volume":"2","author":"hu","year":"2004","journal-title":"The Proc IEEE Intern Conf Commun"}],"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\/04595128.pdf?arnumber=4595128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T15:27:04Z","timestamp":1489678024000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595128\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595128","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}