{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:37:43Z","timestamp":1761561463185,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513628","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"829-833","source":"Crossref","is-referenced-by-count":14,"title":["Algebraic constructions of graph-based nested codes from protographs"],"prefix":"10.1109","author":[{"given":"Christine A.","family":"Kelley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorg","family":"Kliewer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"42","author":"thorpe","year":"2003","journal-title":"Low-density parity-check LDPC codes constructed from protographs"},{"key":"ref11","first-page":"658","volume":"1","author":"divsalar","year":"2005","journal-title":"Constructing LDPC Codes from Simple Loop-Free Encoding Modules"},{"key":"ref12","first-page":"1254","article-title":"On codes obtained via algebraic lifts of graphs","author":"kelley","year":"0","journal-title":"Proc 46th Annual Allerton Conf Commun Control Computing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595095"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557103"},{"journal-title":"Topological Graph Theory","year":"1987","author":"gross","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"ref18","article-title":"Evaluation of Gallager codes for short block length and high rate applications","author":"mackay","year":"0","journal-title":"IMA Workshop on Codes Systems and Graphical Models"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009815"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.255034"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904990"},{"key":"ref8","first-page":"543","article-title":"Array codes as low-density parity check codes","author":"fan","year":"0","journal-title":"Proc 2nd Intl Turbo Code Symp"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318067"},{"key":"ref2","first-page":"19","article-title":"Coding for channel with random parameters","volume":"9","author":"gel'fand","year":"1980","journal-title":"Probl Control Inform Theory\/Probl Upravlen Teor Inform"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513628.pdf?arnumber=5513628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T20:24:37Z","timestamp":1489868677000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513628\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513628","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}