{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:18:59Z","timestamp":1694636339314},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"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":[[2009,5]]},"DOI":"10.1109\/tit.2009.2016025","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T14:26:51Z","timestamp":1240410411000},"page":"2016-2036","source":"Crossref","is-referenced-by-count":3,"title":["Reversible Low-Density Parity-Check Codes"],"prefix":"10.1109","volume":"55","author":[{"given":"David","family":"Haley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Grant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275669"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"ref33","first-page":"226","article-title":"spectral graphs for quasi-cyclic ldpc codes","author":"tanner","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref37","author":"vontobel","year":"0","journal-title":"Personal communication"},{"key":"ref36","first-page":"70","article-title":"lower bounds on the minimum pseudo-weight of linear codes","author":"vontobel","year":"2004","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref35","first-page":"75","article-title":"graph-covers and iterative decoding of finite length codes","author":"ktter","year":"2003","journal-title":"Proc Int Symp Turbo Codes and Related Topics"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref40","first-page":"39","article-title":"explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators","volume":"24","author":"margulis","year":"1988","journal-title":"Probl Inf Transm"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892771"},{"key":"ref12","article-title":"low-density parity-check code design techniques to simplify encoding","volume":"42171","author":"perez","year":"2007","journal-title":"IPN Progress Rep"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/26.848552"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053974"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054261"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.910591"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4.987093"},{"key":"ref29","author":"vontobel","year":"2003","journal-title":"Algebraic coding for iterative decoding"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2005.1465954"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/26.795809"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ARVLSI.2001.915556"},{"key":"ref2","author":"wicker","year":"1995","journal-title":"Error Control Systems for Digital Communication and Storage"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1049\/el:19990065"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-1-4613-0165-3_6","volume":"123","author":"mackay","year":"2000","journal-title":"Codes Systems and Graphical Models"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1188405"},{"key":"ref45","author":"lustenberger","year":"2000","journal-title":"On the design of analog VLSI iterative decoders"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/EURCOM.2000.874812"},{"key":"ref21","author":"strang","year":"1988","journal-title":"Linear Algebra and its Applications"},{"key":"ref42","first-page":"276","article-title":"codes and iterative decoding on algebraic expander graphs","author":"lafferty","year":"2000","journal-title":"Proc Int Symp Information Theory and Its Applications"},{"key":"ref24","first-page":"928","article-title":"construction of cyclic codes suitable for iterative decoding via generating idempotents","volume":"e86 a","author":"shibuya","year":"2003","journal-title":"IEICE Trans Fundamentals"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref44","author":"weisstein","year":"0","journal-title":"Circulant determinant"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref43","first-page":"248","article-title":"constructions of ldpc codes using ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2000","journal-title":"Proc Allerton Conf Communication Control and Computing"},{"key":"ref25","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4839012\/04839030.pdf?arnumber=4839030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:02:39Z","timestamp":1633910559000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4839030\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":45,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2016025","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}