{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:39:12Z","timestamp":1771699152735,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T00:00:00Z","timestamp":1337558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1186\/1687-1499-2012-178","type":"journal-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T04:33:15Z","timestamp":1337574795000},"source":"Crossref","is-referenced-by-count":6,"title":["Improved progressive edge-growth algorithm for fast encodable LDPC codes"],"prefix":"10.1186","volume":"2012","author":[{"given":"Xueqin","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moon Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinpeng","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,21]]},"reference":[{"issue":"1","key":"382_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"IT-8","author":"RG Gallager","year":"1962","unstructured":"Gallager RG: Low density parity check codes. IEEE Trans Inf Theory 1962, IT-8(1):21-28.","journal-title":"IEEE Trans Inf Theory"},{"issue":"18","key":"382_CR2","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"DJC MacKay","year":"1996","unstructured":"MacKay DJC, Neal RM: Near Shannon limit performance of low density parity check codes. IEE Electron Lett 1996, 32(18):1645-1646. 10.1049\/el:19961141","journal-title":"IEE Electron Lett"},{"issue":"3","key":"382_CR3","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J Feldman","year":"2005","unstructured":"Feldman J, Wainwright MJ, Karger DR: Using linear programming to decode binary linear codes. IEEE Trans Inf Theory 2005, 51(3):954-972. 10.1109\/TIT.2004.842696","journal-title":"IEEE Trans Inf Theory"},{"issue":"12","key":"382_CR4","doi-asserted-by":"publisher","first-page":"5396","DOI":"10.1109\/TIT.2008.2006384","volume":"54","author":"MH Taghavi N","year":"2008","unstructured":"Taghavi N MH, Siegel PH: Adaptive methods for linear programming decoding. IEEE Trans Inf Theory 2008, 54(12):5396-5410.","journal-title":"IEEE Trans Inf Theory"},{"key":"382_CR5","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/GLOCOM.2001.965567","volume-title":"IEEE Global Telecommunications Conf. (GLOBECOM)","author":"XY Hu","year":"2001","unstructured":"Hu XY, Eleftheriou E, Arnold DM: Progressive edge-growth Tanner graphs. In IEEE Global Telecommunications Conf. (GLOBECOM). Volume 2. San Antonio, TX; 2001:995-1001."},{"issue":"1","key":"382_CR6","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"XY Hu","year":"2005","unstructured":"Hu XY, Eleftheriou E, Arnold DM: Regular and irregular progressive edge-growth Tanner graphs. IEEE Trans Inf Theory 2005, 51(1):386-398.","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"382_CR7","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1109\/LCOMM.2009.082115","volume":"13","author":"X Jiang","year":"2009","unstructured":"Jiang X, Lee MH: Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem. IEEE Commun Lett 2009, 13(5):342-344.","journal-title":"IEEE Commun Lett"},{"issue":"6","key":"382_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1109\/LSP.2009.2016830","volume":"16","author":"X Jiang","year":"2009","unstructured":"Jiang X, Lee MH: Large girth non-binary LDPC codes based on Euclidean geometries and finite fields. IEEE Signal Process Lett 2009, 16(6):521-524.","journal-title":"IEEE Signal Process Lett"},{"key":"382_CR9","first-page":"1289","volume-title":"IEEE Globecom 2002","author":"D Haley","year":"2002","unstructured":"Haley D, Grant A, Buetefuer J: Iterative encoding of low-density parity-check codes. In IEEE Globecom 2002. Volume 2. Taipei, Taiwan, Roc; 2002:1289-1293."},{"issue":"2","key":"382_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/LCOMM.2009.081766","volume":"13","author":"M Baldi","year":"2009","unstructured":"Baldi M, Cancellieri G, Carassai A, Chiaraluce F: LDPC codes based on serially concatenated multiple parity-check codes. IEEE Commun Lett 2009, 13(2):142-144.","journal-title":"IEEE Commun Lett"},{"issue":"6","key":"382_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"IT-27","author":"RM Tanner","year":"1981","unstructured":"Tanner RM: A recursive approach to low complexity codes. IEEE Trans Inf Theory 1981, IT-27(6):533-547.","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"382_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/TIT.2009.2034823","volume":"56","author":"J Lu","year":"2010","unstructured":"Lu J, Moura JMF: Linear time encoding of LDPC codes. IEEE Trans Inf Theory 2010, 56(1):233-249.","journal-title":"IEEE Trans Inf Theory"},{"issue":"24","key":"382_CR13","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1049\/el.2009.2314","volume":"45","author":"X Jiang","year":"2009","unstructured":"Jiang X, Lee MH: Semi-random LDPC codes with efficient encoding. IEE Electron Lett 2009, 45(24):1259-1260. 10.1049\/el.2009.2314","journal-title":"IEE Electron Lett"},{"issue":"10","key":"382_CR14","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1109\/TCOMM.2003.818085","volume":"51","author":"JSK Tee","year":"2003","unstructured":"Tee JSK, Taylor DP, Martin PA: Multiple serial and parallel concatenated single parity-check codes. IEEE Trans Commun 2003, 51(10):1666-1675. 10.1109\/TCOMM.2003.818085","journal-title":"IEEE Trans Commun"},{"issue":"4","key":"382_CR15","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1109\/TIT.2007.892771","volume":"53","author":"S Freundlich","year":"2007","unstructured":"Freundlich S, Burshtein D, Litsyn S: Approximately lower triangular ensembles of LDPC codes with linear encoding complexity. IEEE Trans Inf Theory 2007, 53(4):1484-1494.","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"382_CR16","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1109\/TIT.2006.890694","volume":"53","author":"G Yue","year":"2007","unstructured":"Yue G, Ping L, Wang X: Generalized low-density parity-check codes based on Hadamard constraints. IEEE Trans Inf Theory 2007, 53(3):1058-1079.","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"382_CR17","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/LCOMM.2003.813816","volume":"7","author":"J Garcia-Frias","year":"2003","unstructured":"Garcia-Frias J, Zhong W: Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix. IEEE Commun Lett 2003, 7(6):266-268.","journal-title":"IEEE Commun Lett"},{"issue":"2","key":"382_CR18","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"T Richardson","year":"2001","unstructured":"Richardson T, Shokrollahi MA, Urbanke R: Design of capacityapproaching irregular low-density parity-check codes. IEEE Trans Inf Theory 2001, 47(2):619-637. 10.1109\/18.910578","journal-title":"IEEE Trans Inf Theory"},{"key":"382_CR19","first-page":"2549","volume-title":"VTC","author":"W Weng","year":"2004","unstructured":"Weng W, Ramamoorthy A, Wesel R: Lowering the error floors of irregular high-rate ldpc codes by graph conditioning. In VTC. Volume 4. Los Angeles, California; 2004:2549-2553."},{"key":"382_CR20","first-page":"285","volume-title":"Proc SoftCOM","author":"M Baldi","year":"2010","unstructured":"Baldi M, Cancellieri G, Chiaraluce F, De Amicis A: Design of permuted serially concatenated multiple parity-check codes. In Proc SoftCOM. Volume 1. Split, Croatia; 2010:285-289."},{"key":"382_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/EW.2010.5483448","volume-title":"Proc 2010 European Wireless Conference, EW","author":"M Baldi","year":"2010","unstructured":"Baldi M, Cancellieri G, Chiaraluce F, De Amicis A: Irregular M-SC-MPC codes for wireless applications. In Proc 2010 European Wireless Conference, EW. Volume 1. Lucca, Italy; 2010:369-376."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2012-178\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2012-178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2012-178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T11:13:14Z","timestamp":1548155594000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2012-178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,21]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["382"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2012-178","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,21]]},"article-number":"178"}}