{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T16:53:00Z","timestamp":1725382380536},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523458","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"855-859","source":"Crossref","is-referenced-by-count":1,"title":["An algebraic method for constructing efficiently encodable irregular LDPC codes"],"prefix":"10.1109","author":[{"given":"H.","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ohata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Sakaniwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"journal-title":"Modern Coding Theroy EPFL","year":"2005","author":"richardson","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826367"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312527"},{"key":"ref4","first-page":"543","article-title":"Array codes as low density parity check codes","author":"fan","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes and Related Topics"},{"key":"ref3","first-page":"201","article-title":"Coding theorems for ‘turbo-like’ codes","author":"divsalar","year":"1998","journal-title":"Proc 36th Allerton Conf on Communication Control and Computing"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-Density Parity-Check Codes","author":"gallager","year":"1963"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref8","first-page":"1","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes and Related Topics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1204466"},{"key":"ref2","first-page":"535","article-title":"An algebraic method for constructing quasi-cyclic LDPC codes","author":"chen","year":"2004","journal-title":"Proc 2004 ISITA"},{"key":"ref1","first-page":"239","article-title":"Construction of quasi-cyclic LDPC codes based on the minimum weight codewords of Reed-Solomon codes","author":"chen","year":"2004","journal-title":"Proc 2004 IEEE ISIT"},{"key":"ref9","first-page":"529","article-title":"A study on rate-compatible LDPC codes","author":"matsumoto","year":"2004","journal-title":"Proc 2004 ISITA"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523458.pdf?arnumber=1523458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T16:43:09Z","timestamp":1555864989000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523458\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523458","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}