{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:52:22Z","timestamp":1762865542430},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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. Commun."],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/tcomm.2009.06.0700712","type":"journal-article","created":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T14:57:22Z","timestamp":1245941842000},"page":"1566-1573","source":"Crossref","is-referenced-by-count":54,"title":["Toward low LDPC-code floors: a case study"],"prefix":"10.1109","volume":"57","author":[{"given":"Yifei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"William E.","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"stepanov","year":"0","journal-title":"Improving convergence of belief propagation decoding"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.160"},{"key":"ref33","year":"2003","journal-title":"Digital video broadcasting (DVB) second generation farming structure channel coding and modulation systems for broadcasting interactive services news gathering and other broadband satellite applications"},{"key":"ref32","article-title":"Low-complexity approximations to belief propagation for LDPC codes","author":"thorpe","year":"2003","journal-title":"Proc IEEE ISIT"},{"key":"ref31","article-title":"A highly efficient importance sampling method for LDPC codes using trapping sets","author":"cavus","year":"0","journal-title":"IEEE Trans Commun"},{"key":"ref30","year":"2005","journal-title":"Node processors for use in parity check decoders"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/TIT.2006.889701","article-title":"Results on punctured low-density parity check codes and improved iterative decoding techniques","volume":"53","author":"pishro-nik","year":"2007","journal-title":"IEEE Trans Inform Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.881402"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.836563"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.896139"},{"key":"ref40","article-title":"Loop calculus helps to improve beleif propagation and linear programming decoding of low-density parity-check codes","author":"chertkov","year":"2006","journal-title":"Proc 44th Annual Allerton Conf Commun Control Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2005.861748"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860439"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651870"},{"key":"ref14","first-page":"630","article-title":"Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes","volume":"1","author":"lander","year":"2005","journal-title":"Proc International Conf Wireless Networks Commun Mobile Computing"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref16","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41th Allerton Conf Commun Computing Control"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref18","author":"blaum","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"ref28","author":"yang","year":"2004","journal-title":"Construction of low-density parity-check codes for data storage and transmission"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"ref27","first-page":"42","author":"thorpe","year":"2003","journal-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs"},{"key":"ref3","first-page":"995","article-title":"Progressive edge-growth Tanner graphs","volume":"2","author":"hu","year":"2001","journal-title":"Proc IEEE Globecom"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365542"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2001.953647"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887082"},{"key":"ref8","first-page":"2549","article-title":"Lowering the error floors of irregular high-rate LDPC codes by graph condition","volume":"4","author":"weng","year":"2004","journal-title":"Proc IEEE 60th Veh Technol Conf"},{"key":"ref7","first-page":"2292","article-title":"Accumulate-repeat-accumulate-accumulate-codes","volume":"3","author":"divsalar","year":"2004","journal-title":"Proc IEEE 60th Veh Technol Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2005.1605713"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref22","first-page":"49","article-title":"Area efficient decoding of quasi-cyclic low density parity check codes","volume":"5","author":"wang","year":"2004","journal-title":"Proc IEEE International Conf Acoust Speech Signal Processing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/VETECF.2003.1285102"},{"key":"ref24","article-title":"On quasi-cyclic repeat-accumulate codes","author":"tanner","year":"1999","journal-title":"Proc 37th Allerton Conf Commun Control Computing"},{"key":"ref23","article-title":"Field programmable gate array implementation of a generalized decoder for structured low-density parity-check codes","author":"sun","year":"2004","journal-title":"Proc IEEE International Conf Field Programmable Technology"},{"key":"ref26","article-title":"Multi-edge type LDPC codes","author":"richardson","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841966"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/5089481\/05089487.pdf?arnumber=5089487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:41:59Z","timestamp":1638218519000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5089487\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":40,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2009.06.0700712","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}