{"id":"https://openalex.org/W2564871644","doi":"https://doi.org/10.1109/isit.2004.1365245","title":"Performance of low-density parity-check codes with linear minimum distance","display_name":"Performance of low-density parity-check codes with linear minimum distance","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2564871644","doi":"https://doi.org/10.1109/isit.2004.1365245","mag":"2564871644"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365245","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":"conference-paper","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/A5009685038","display_name":"Hossein Pishro-Nik","orcid":"https://orcid.org/0000-0002-7249-2548"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Pishro-Nik","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083854532","display_name":"Faramarz Fekri","orcid":"https://orcid.org/0000-0001-5008-8803"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. Fekri","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26126548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"208","last_page":"208"},"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.9990000128746033,"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.9987000226974487,"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.8883429765701294},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6634728908538818},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5838066339492798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5592918992042542},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5117166042327881},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4702516794204712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43812209367752075},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43700820207595825},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4224678874015808},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3887918293476105},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3883618116378784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3382880389690399},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3230254650115967},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.23505008220672607}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8883429765701294},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6634728908538818},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5838066339492798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5592918992042542},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5117166042327881},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4702516794204712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43812209367752075},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43700820207595825},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4224678874015808},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3887918293476105},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3883618116378784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3382880389690399},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3230254650115967},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.23505008220672607},{"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/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.2004.1365245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365245","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1818146586","https://openalex.org/W2094702915","https://openalex.org/W2095882513","https://openalex.org/W2104345270","https://openalex.org/W2115104320","https://openalex.org/W2122927420","https://openalex.org/W2126276563","https://openalex.org/W2127490352","https://openalex.org/W2156055959","https://openalex.org/W2163247103","https://openalex.org/W2163496715","https://openalex.org/W2165573107","https://openalex.org/W2167943285","https://openalex.org/W2169732368","https://openalex.org/W2538622964"],"related_works":["https://openalex.org/W1650655882","https://openalex.org/W2126543779","https://openalex.org/W2169811229","https://openalex.org/W2011293233","https://openalex.org/W2167124952","https://openalex.org/W2124450281","https://openalex.org/W2169710030","https://openalex.org/W4388717827","https://openalex.org/W2065071381","https://openalex.org/W2100451453"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,6,30,45,60],"performance":[4],"of":[5,9,33,47],"iterative":[7],"decoding":[8],"LDPC":[10,48],"code":[11],"ensembles":[12,35],"that":[13],"have":[14],"linear":[15,51],"typical":[16],"minimum":[17,52],"distance":[18],"and":[19],"stopping":[20],"set":[21],"size.":[22],"We":[23],"first":[24],"obtain":[25],"a":[26],"lower":[27],"bound":[28],"on":[29,44],"achievable":[31],"rates":[32],"these":[34],"over":[36,59],"MBIOS":[37],"channels.":[38],"Then,":[39],"we":[40],"give":[41],"upper":[42],"bounds":[43],"rate":[46],"codes":[49],"with":[50],"distance,":[53],"given":[54],"their":[55],"right":[56],"degree":[57],"distribution":[58],"BEC.":[61]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}