{"id":"https://openalex.org/W2563971734","doi":"https://doi.org/10.1109/isit.2005.1523290","title":"Upper bounds on the rate of LDPC codes as a function of minimum distance","display_name":"Upper bounds on the rate of LDPC codes as a function of minimum distance","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2563971734","doi":"https://doi.org/10.1109/isit.2005.1523290","mag":"2563971734"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523290","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5038326851","display_name":"Yael Ben\u2010Haim","orcid":"https://orcid.org/0000-0002-2978-6313"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Y. Ben-Haim","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044662173","display_name":"Simon Litsyn","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"S. Litsyn","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5477,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76728673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"47","last_page":"51"},"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.9976999759674072,"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.9954000115394592,"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.9044393301010132},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6494329571723938},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5852076411247253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5798744559288025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4925130307674408},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4585248529911041},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4520523250102997},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4422231614589691},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4119430184364319},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.37350577116012573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33251953125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2994590103626251},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2903839349746704}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9044393301010132},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6494329571723938},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5852076411247253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5798744559288025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4925130307674408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4585248529911041},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4520523250102997},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4422231614589691},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4119430184364319},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.37350577116012573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33251953125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2994590103626251},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2903839349746704},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523290","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W805584244","https://openalex.org/W1529052492","https://openalex.org/W1606480398","https://openalex.org/W2108489927","https://openalex.org/W2109084006","https://openalex.org/W2126276563","https://openalex.org/W2128765501","https://openalex.org/W2138182514","https://openalex.org/W2159887350","https://openalex.org/W2163496715","https://openalex.org/W2167943285","https://openalex.org/W2563971734","https://openalex.org/W2578656579","https://openalex.org/W4230131939","https://openalex.org/W4300188436","https://openalex.org/W6604469142","https://openalex.org/W6623024008","https://openalex.org/W6732483905"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2540115800","https://openalex.org/W2167713507","https://openalex.org/W2034110706","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W4386066307","https://openalex.org/W2086661663"],"abstract_inverted_index":{"New":[0],"upper":[1],"bounds":[2,24,38],"on":[3,27,35],"the":[4,15,19,36,61,65],"rate":[5,52],"of":[6,14,18],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"codes":[10,54],"as":[11],"a":[12],"function":[13],"minimum":[16,58],"distance":[17,59],"code":[20],"are":[21,25],"derived.":[22],"These":[23],"based":[26],"combinatorial":[28],"arguments":[29],"and":[30],"linear":[31],"programming.":[32],"They":[33],"improve":[34],"previous":[37],"due":[39],"to":[40],"Burshtein":[41],"et":[42],"al.":[43],"It":[44],"is":[45],"proved":[46],"that":[47],"at":[48],"least":[49],"for":[50],"high":[51],"LDPC":[53],"have":[55],"worse":[56],"relative":[57],"than":[60],"one":[62],"guaranteed":[63],"by":[64],"Gilbert-Varshamov":[66],"bound":[67]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}