{"id":"https://openalex.org/W2106117658","doi":"https://doi.org/10.1109/isit.2004.1365107","title":"Analysis of an algorithm for irregular LDPC code construction","display_name":"Analysis of an algorithm for irregular LDPC code construction","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2106117658","doi":"https://doi.org/10.1109/isit.2004.1365107","mag":"2106117658"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365107","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Ramamoorthy","raw_affiliation_strings":["Department of Electrical Engineering, University of California, Los Angeles, USA","Dept. of Electr. Eng., California Univ., Los Angeles, CA, , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"Dept. of Electr. Eng., California Univ., Los Angeles, CA, , USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013185545","display_name":"Richard D. Wesel","orcid":"https://orcid.org/0000-0002-9139-8098"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.D. Wesel","raw_affiliation_strings":["Department of Electrical Engineering, University of California, Los Angeles, USA","Dept. of Electr. Eng., California Univ., Los Angeles, CA, , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"Dept. of Electr. Eng., California Univ., Los Angeles, CA, , USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7467,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87687867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"70","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7225490212440491},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.671301007270813},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6481162309646606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6091366410255432},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5297784805297852},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3479682207107544},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32589903473854065},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10908323526382446}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7225490212440491},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.671301007270813},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6481162309646606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6091366410255432},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5297784805297852},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3479682207107544},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32589903473854065},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10908323526382446},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2004.1365107","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.4455","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.4455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.ucla.edu/~adityar/adi_docs/adiisit2004.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8299999833106995,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1813544306","https://openalex.org/W1818146586","https://openalex.org/W2095882513","https://openalex.org/W2109489513","https://openalex.org/W2127490352","https://openalex.org/W2141552223","https://openalex.org/W2163496715","https://openalex.org/W2167943285","https://openalex.org/W2169732368","https://openalex.org/W4230131939"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W2806845321","https://openalex.org/W4293418541","https://openalex.org/W2393084694","https://openalex.org/W4213381250","https://openalex.org/W1968289971","https://openalex.org/W4300588357"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"a":[3,39,48,66,80],"rigorous":[4],"analysis":[5],"of":[6,18,31,35,38,61,77,79],"an":[7],"algorithm":[8,45,55],"proposed":[9],"by":[10],"Tian":[11],"et":[12],"al.":[13],"(2003)":[14],"for":[15,85],"the":[16,32,44,54,58,71],"construction":[17],"irregular":[19],"LDPC":[20],"codes":[21],"with":[22],"reduced":[23],"stopping":[24,36,62],"sets":[25,37,63],"and":[26],"low":[27],"error":[28],"floors.":[29],"Computation":[30],"expected":[33,59,75],"number":[34,60,76],"given":[40,81],"size":[41,68,82],"proves":[42],"that":[43,53],"significantly":[46],"outperforms":[47],"random":[49],"construction.":[50],"We":[51],"show":[52],"provably":[56],"reduces":[57],"up":[64],"to":[65],"certain":[67],"(based":[69],"on":[70],"input":[72],"parameters).":[73],"The":[74],"cycles":[78],"is":[83],"computed":[84],"both":[86],"constructions.":[87]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}