{"id":"https://openalex.org/W2154440950","doi":"https://doi.org/10.1109/isit.2009.5205794","title":"LDPC decoding and code design on extrinsic trees","display_name":"LDPC decoding and code design on extrinsic trees","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2154440950","doi":"https://doi.org/10.1109/isit.2009.5205794","mag":"2154440950"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5026883018","display_name":"Eric Psota","orcid":"https://orcid.org/0000-0002-7836-298X"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric Psota","raw_affiliation_strings":["Department of Electrical Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035202198","display_name":"Lance C. P\u00e9rez","orcid":"https://orcid.org/0000-0002-9733-9347"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lance C. Perez","raw_affiliation_strings":["Department of Electrical Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026883018"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.7142,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86420347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2161","last_page":"2165"},"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.9937000274658203,"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.9860000014305115,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8831675052642822},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8654626607894897},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.7269419431686401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6498432159423828},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5972023606300354},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5573253631591797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5220599174499512},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4934943914413452},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4900113642215729},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48828673362731934},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48281988501548767},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.46543756127357483},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.44990357756614685},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4097940921783447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25472038984298706},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.15568873286247253},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.14258772134780884},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08420562744140625}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8831675052642822},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8654626607894897},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.7269419431686401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6498432159423828},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5972023606300354},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5573253631591797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5220599174499512},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4934943914413452},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4900113642215729},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48828673362731934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48281988501548767},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.46543756127357483},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.44990357756614685},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4097940921783447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25472038984298706},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.15568873286247253},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.14258772134780884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08420562744140625},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1595640491","https://openalex.org/W2001732758","https://openalex.org/W2126877780","https://openalex.org/W2127490352","https://openalex.org/W2142414818","https://openalex.org/W2167734735","https://openalex.org/W2169732368","https://openalex.org/W3037126606","https://openalex.org/W6780309242"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W1978153242","https://openalex.org/W2392775688"],"abstract_inverted_index":{"Extrinsic":[0],"tree":[1,26,53,68],"decoding":[2,42],"of":[3,18,23,35,61],"low-density":[4],"parity-check":[5,62],"codes":[6],"operates":[7],"on":[8,64],"modified,":[9],"finite":[10],"computation":[11],"trees":[12],"created":[13],"from":[14],"the":[15,19,24,33,59,66],"Tanner":[16],"graph":[17],"code.":[20],"The":[21,51],"goal":[22],"extrinsic":[25,52,67],"algorithm":[27,43,54],"is":[28,55],"to":[29],"maintain":[30],"or":[31],"improve":[32],"performance":[34],"existing":[36],"iterative":[37],"decoders,":[38],"while":[39],"providing":[40],"a":[41],"for":[44],"which":[45,65],"upper":[46],"bounds":[47],"can":[48],"be":[49],"computed.":[50],"examined,":[56],"along":[57],"with":[58],"design":[60],"matrices":[63],"decoder":[69],"performs":[70],"well.":[71]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}