{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:44:12Z","timestamp":1761662652866,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557557","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T00:17:12Z","timestamp":1215562632000},"page":"2266-2270","source":"Crossref","is-referenced-by-count":4,"title":["Designing LDPC Codes without small trapping sets by using Tanner Graph Covers"],"prefix":"10.1109","author":[{"given":"Milos","family":"Ivkovic","sequence":"first","affiliation":[]},{"given":"Shashi Kiran","family":"Chilappagari","sequence":"additional","affiliation":[]},{"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261701"},{"key":"ref11","article-title":"Error Floors of LDPC Codes","author":"richardson","year":"0","journal-title":"Proc 41st Annual Allerton Conf on Communications Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.228701"},{"key":"ref13","article-title":"Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation","author":"zhang","year":"2006","journal-title":"IEEE GLOBECOM"},{"article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","year":"0","author":"vontobel","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899563"},{"article-title":"Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes","year":"0","author":"smarandache","key":"ref16"},{"key":"ref17","first-page":"101112","article-title":"On the effective weights of pseudocodewords for codes defined on graphs with cycles","author":"forney","year":"1999","journal-title":"Codes Systems and Graphical Models"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.060444"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MSP.2004.1267048","article-title":"Structured LDPC codes with large girth","volume":"21","author":"moura","year":"2004","journal-title":"IEEE Signal Proc Mag"},{"key":"ref7","first-page":"51","article-title":"Explicit Group-Theoretic Constructions for Combinatorial Designs with Applications To Expanders and Concentrators","volume":"24","author":"margulis","year":"1988","journal-title":"Probl Pered Inform"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"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","article-title":"When does one redundant parity-check equation matter?","author":"laendner","year":"2006","journal-title":"Proc IEEE Globecom"},{"key":"ref22","article-title":"A class of Group-Structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc ISCTA"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323762"},{"article-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref24"},{"key":"ref23","first-page":"248","article-title":"Constructions of LDPC Codes Using Ramanujan Graphs and Ideas From Margulis","author":"rosenthal","year":"2000","journal-title":"Proc of the 38-th Annual Allerton Conference on Communication Control and Computing"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892774"},{"key":"ref25","article-title":"Protgraph LDPC Codes with Node Degrees at Least 3","author":"divsalar","year":"2006","journal-title":"Proc IEEE Globecom"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557557.pdf?arnumber=4557557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T11:13:17Z","timestamp":1557659597000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557557\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557557","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}