{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:51:55Z","timestamp":1778255515646,"version":"3.51.4"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/glocom.2004.1377995","type":"proceedings-article","created":{"date-parts":[[2005,2,22]],"date-time":"2005-02-22T20:29:50Z","timestamp":1109104190000},"page":"489-492","source":"Crossref","is-referenced-by-count":9,"title":["Improved progressive-edge-growth (PEG) construction of irregular LDPC codes"],"prefix":"10.1109","volume":"1","author":[{"family":"Hua Xiao","sequence":"first","affiliation":[]},{"given":"A.H.","family":"Banihashemi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"41","article-title":"Search for good low-density parity check codes using girth distribution","volume":"1","author":"mao","year":"2001","journal-title":"Proc IEEE ICC 2001"},{"key":"ref11","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annual Allerton Conference on Communication Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"ref15","article-title":"Selective Avoidance of Cycles in Irregular LDPC Code Construction","author":"tian","year":"2002","journal-title":"Submitted to IEEE Trans on Comm"},{"key":"ref4","first-page":"480","article-title":"Irregular Progressive Edge-Growth (PEG) Tanner Graphs","author":"hu","year":"2002","journal-title":"Proc IEEE ISIT 2002"},{"key":"ref3","first-page":"995","article-title":"Progressive edge-growth Tanner graphs","author":"hu","year":"2001","journal-title":"Proc IEEE GLOBECOM 2001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023752"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)80768-0","article-title":"Weakness of Margulis and Ramanujan-Margulis low-density parity-check codes","author":"mackay","year":"2003","journal-title":"Electronic Notes in Theoretical Computer Science 74"},{"key":"ref7","author":"mackay","year":"0"},{"key":"ref2","author":"hu","year":"2004","journal-title":"private communication"},{"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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/26.795809"}],"event":{"name":"GLOBECOM '04. IEEE Global Telecommunications Conference","location":"Dallas, TX, USA","acronym":"GLOCOM-04"},"container-title":["IEEE Global Telecommunications Conference, 2004. GLOBECOM '04."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9481\/30077\/01377995.pdf?arnumber=1377995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:49:03Z","timestamp":1586123343000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1377995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/glocom.2004.1377995","relation":{},"subject":[]}}