{"id":"https://openalex.org/W2144143689","doi":"https://doi.org/10.1109/isit.2009.5205822","title":"Lower bounds on the graphical complexity of finite-length LDPC codes","display_name":"Lower bounds on the graphical complexity of finite-length LDPC codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2144143689","doi":"https://doi.org/10.1109/isit.2009.5205822","mag":"2144143689"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205822","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/A5032026808","display_name":"Igal Sason","orcid":"https://orcid.org/0000-0001-5681-1273"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Igal Sason","raw_affiliation_strings":["Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","[Department of electrical Engineering, Technion, Haifa, 32000, Israel]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"[Department of electrical Engineering, Technion, Haifa, 32000, Israel]","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032026808"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2004008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"223"},"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.9983999729156494,"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.9975000023841858,"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.8412290215492249},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6663984060287476},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5692101716995239},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.518541157245636},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.504245400428772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4625301957130432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46109381318092346},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4596947729587555},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44666558504104614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4351575970649719},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.4190332889556885},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40349525213241577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.367829829454422},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3622041642665863},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10981887578964233},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07499238848686218}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8412290215492249},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6663984060287476},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5692101716995239},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.518541157245636},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.504245400428772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4625301957130432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46109381318092346},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4596947729587555},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44666558504104614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4351575970649719},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.4190332889556885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40349525213241577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.367829829454422},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3622041642665863},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10981887578964233},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07499238848686218},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205822","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.334.4363","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.4363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://webee.technion.ac.il/people/sason/ISIT09_paper2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1596316491","https://openalex.org/W1996680908","https://openalex.org/W2005530146","https://openalex.org/W2044180609","https://openalex.org/W2077796887","https://openalex.org/W2098666392","https://openalex.org/W2098831078","https://openalex.org/W2110372787","https://openalex.org/W2113420173","https://openalex.org/W2115116691","https://openalex.org/W2115228681","https://openalex.org/W2125259700","https://openalex.org/W2125992207","https://openalex.org/W2136307214","https://openalex.org/W2139769859","https://openalex.org/W2154734383","https://openalex.org/W2162764056","https://openalex.org/W2165712250","https://openalex.org/W2963619914","https://openalex.org/W3103206756","https://openalex.org/W6635909561"],"related_works":["https://openalex.org/W1650655882","https://openalex.org/W2126543779","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W2167124952","https://openalex.org/W2011293233","https://openalex.org/W2169710030","https://openalex.org/W2065071381","https://openalex.org/W4388717827","https://openalex.org/W2124450281"],"abstract_inverted_index":{"This":[0,99],"paper":[1,105],"considers":[2],"information-theoretic":[3],"lower":[4,60],"bounds":[5,34,61,79],"on":[6,62,102],"the":[7,18,21,33,41,63,84,90,103],"graphical":[8,64,93],"complexity":[9,65,94],"of":[10,20,40,95],"finite-length":[11,96],"LDPC":[12,71,97],"codes.":[13,98],"It":[14],"is":[15],"assumed":[16],"that":[17,77],"transmission":[19],"codes":[22,72],"takes":[23],"place":[24],"over":[25],"a":[26,38],"memoryless":[27],"binary-input":[28],"output-symmetric":[29],"(MBIOS)":[30],"channel,":[31],"and":[32,44,92],"are":[35,66,80],"expressed":[36],"as":[37],"function":[39],"code":[42,74],"performance":[43,91],"their":[45],"achievable":[46],"gap":[47],"to":[48,68],"capacity":[49],"(either":[50],"under":[51],"ML":[52],"decoding":[53,57],"or":[54],"any":[55],"sub-optimal":[56],"algorithm).":[58],"The":[59],"compared":[67],"some":[69],"explicit":[70],"(or":[73],"ensembles),":[75],"showing":[76],"these":[78],"informative":[81],"for":[82],"considering":[83],"fundamental":[85],"tradeoff":[86],"which":[87],"exists":[88],"between":[89],"work":[100],"relies":[101],"full":[104],"version.":[106]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}