{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:15:49Z","timestamp":1766733349015},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2095211","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"835-857","source":"Crossref","is-referenced-by-count":110,"title":["Deriving Good LDPC Convolutional Codes from LDPC Block Codes"],"prefix":"10.1109","volume":"57","author":[{"given":"A E","family":"Pusane","sequence":"first","affiliation":[]},{"given":"R","family":"Smarandache","sequence":"additional","affiliation":[]},{"given":"P O","family":"Vontobel","sequence":"additional","affiliation":[]},{"given":"Daniel J","family":"Costello","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557390"},{"key":"ref38","first-page":"819","article-title":"New low-density parity-check codes with large girth based on hypergraphs","author":"hug","year":"2010","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1996.0050"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.651076"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/dimacs\/014\/22","volume":"14","author":"levy","year":"1993","journal-title":"Coding and Quantization"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050519"},{"key":"ref37","article-title":"a [155, 64, 20] sparse graph (ldpc) code","author":"tanner","year":"2000","journal-title":"IEEE Int Symp Inf Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018347"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref34","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503166"},{"key":"ref27","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2008.918002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref20","first-page":"249","article-title":"On quasi-cyclic repeat-accumulate codes","author":"tanner","year":"1999","journal-title":"Proc 37th Allerton Conf Commun Control Comput"},{"key":"ref22","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes Related Topics"},{"key":"ref21","first-page":"42","author":"thorpe","year":"2003","journal-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254904"},{"key":"ref23","author":"vontobel","year":"2005","journal-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513638"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","volume":"123","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025529"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref54","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365107"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref40","article-title":"A comparison between LDPC block and convolutional codes","author":"costello","year":"2006","journal-title":"Proc Inf Theory Appl Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2006.880313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2005.1517231"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2006.1693780"},{"key":"ref16","year":"1981","journal-title":"Error-Correcting Coding System"},{"key":"ref17","author":"tanner","year":"1987","journal-title":"Convolutional codes from quasi-cyclic codes A link between the theories of block and convolutional codes"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref3","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910580"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2009.5044941"},{"key":"ref45","year":"2007","journal-title":"Low Density Parity Check Codes for Use in Near-Earth and Deep Space Applications"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454141"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013815115684"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2007.4357569"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1109\/GLOCOM.2005.1577834","article-title":"Protograph based LDPC codes with minimum distance linearly growing with block size","volume":"3","author":"divsalar","year":"2005","journal-title":"Proc IEEE Global Telecommun Conf"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695133.pdf?arnumber=5695133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:40Z","timestamp":1633909660000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695133\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":58,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2095211","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}