{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:39:24Z","timestamp":1725453564664},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875273","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"2445-2448","source":"Crossref","is-referenced-by-count":0,"title":["Non-binary LDPC codes with large alphabet size"],"prefix":"10.1109","author":[{"given":"Koji","family":"Tazoe","sequence":"first","affiliation":[]},{"given":"Kenta","family":"Kasai","sequence":"additional","affiliation":[]},{"given":"Kohichi","family":"Sakaniwa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Non-Binary LDPC Codes and EXIT Like Functions","year":"2008","author":"rathi","key":"19"},{"key":"17","first-page":"42","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2003","journal-title":"IPN Progress Report"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"journal-title":"Coding for network coding","year":"2007","author":"montanari","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284231"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284229"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2236912"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620663"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.061112.110177"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162259"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649550"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706927"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2167593"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875273.pdf?arnumber=6875273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:25:23Z","timestamp":1602674723000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875273","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}