{"id":"https://openalex.org/W2112826979","doi":"https://doi.org/10.1109/tcomm.2014.2385858","title":"On the Design of Fast Convergent LDPC Codes for the BEC: An Optimization Approach","display_name":"On the Design of Fast Convergent LDPC Codes for the BEC: An Optimization Approach","publication_year":2014,"publication_date":"2014-12-24","ids":{"openalex":"https://openalex.org/W2112826979","doi":"https://doi.org/10.1109/tcomm.2014.2385858","mag":"2112826979"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2014.2385858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2014.2385858","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1401.4337","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087843323","display_name":"Vahid Jamali","orcid":"https://orcid.org/0000-0003-3920-7415"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vahid Jamali","raw_affiliation_strings":["Inst. for Digital Commun., FriedrichAlexander-Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany","Inst. for Digital Commun., FriedrichAlexander Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. for Digital Commun., FriedrichAlexander-Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Inst. for Digital Commun., FriedrichAlexander Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066815514","display_name":"Yasser Karimian","orcid":null},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Yasser Karimian","raw_affiliation_strings":["Dept. of Commun., K.N. Toosi Univ. of Technol., Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Commun., K.N. Toosi Univ. of Technol., Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028217481","display_name":"Johannes B. Huber","orcid":"https://orcid.org/0000-0003-2586-5249"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johannes Huber","raw_affiliation_strings":["Inst. for Inf. Transm., FriedrichAlexander-Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. for Inf. Transm., FriedrichAlexander-Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112058783","display_name":"Mahmoud Ahmadian Attari","orcid":null},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mahmoud Ahmadian Attari","raw_affiliation_strings":["Dept. of Commun., K.N. Toosi Univ. of Technol., Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Commun., K.N. Toosi Univ. of Technol., Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7413,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87125183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"63","issue":"2","first_page":"351","last_page":"363"},"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.9919999837875366,"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.8011023998260498},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5732181668281555},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5635726451873779},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5023622512817383},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4679103493690491},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46592211723327637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4606587290763855},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46026498079299927},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45953798294067383},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4441564679145813},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.437078595161438},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4287334084510803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4237602949142456},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3414686322212219},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.25340062379837036},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2530796527862549},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2205185890197754}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8011023998260498},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5732181668281555},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5635726451873779},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5023622512817383},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4679103493690491},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46592211723327637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4606587290763855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46026498079299927},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45953798294067383},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4441564679145813},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.437078595161438},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4287334084510803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4237602949142456},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3414686322212219},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.25340062379837036},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2530796527862549},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2205185890197754},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcomm.2014.2385858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2014.2385858","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1401.4337","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1401.4337","pdf_url":"https://arxiv.org/pdf/1401.4337","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1401.4337","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1401.4337","pdf_url":"https://arxiv.org/pdf/1401.4337","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W137390859","https://openalex.org/W213300876","https://openalex.org/W1503221585","https://openalex.org/W1536930200","https://openalex.org/W1568307856","https://openalex.org/W1570910772","https://openalex.org/W1965728334","https://openalex.org/W1992687376","https://openalex.org/W2017487997","https://openalex.org/W2022381080","https://openalex.org/W2075887074","https://openalex.org/W2110937818","https://openalex.org/W2113120847","https://openalex.org/W2114468914","https://openalex.org/W2115104320","https://openalex.org/W2125259700","https://openalex.org/W2127490352","https://openalex.org/W2136307214","https://openalex.org/W2137699000","https://openalex.org/W2139769859","https://openalex.org/W2151937123","https://openalex.org/W2156055959","https://openalex.org/W2158511475","https://openalex.org/W2158669549","https://openalex.org/W2158860695","https://openalex.org/W2163706521","https://openalex.org/W2165573107","https://openalex.org/W2296319761","https://openalex.org/W2912673962","https://openalex.org/W3105100821","https://openalex.org/W4248307298","https://openalex.org/W4248556524","https://openalex.org/W4250589301","https://openalex.org/W4300188436","https://openalex.org/W4307087408","https://openalex.org/W6669709395","https://openalex.org/W6683202485","https://openalex.org/W6683321016"],"related_works":["https://openalex.org/W2156055959","https://openalex.org/W2372190485","https://openalex.org/W1525070854","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2140357074","https://openalex.org/W4386075170","https://openalex.org/W1656451834","https://openalex.org/W4309132699","https://openalex.org/W4297912917"],"abstract_inverted_index":{"The":[0],"complexity-performance":[1],"trade-off":[2],"is":[3,77],"a":[4,41,52,65],"fundamental":[5],"aspect":[6],"of":[7,10,36,56,59,75,120,142,164],"the":[8,23,57,62,73,80,84,96,110,113,118,131,134,140,148,162,165],"design":[9,168],"low-density":[11],"parity-check":[12],"(LDPC)":[13],"codes.":[14],"In":[15,108],"this":[16],"paper,":[17],"we":[18],"consider":[19],"LDPC":[20],"codes":[21],"for":[22,31,46,61],"binary":[24],"erasure":[25,44],"channel":[26],"(BEC),":[27],"use":[28],"code":[29,97,167,172],"rate":[30],"performance":[32],"metric,":[33],"and":[34,83,146],"number":[35,58,74],"decoding":[37],"iterations":[38,60,76],"to":[39,72,94,117,127,170],"achieve":[40],"certain":[42],"residual":[43],"probability":[45],"complexity":[47,91],"metric.":[48],"We":[49,100],"first":[50],"propose":[51],"quite":[53],"accurate":[54],"approximation":[55,82,115],"BEC.":[63],"Moreover,":[64],"simple":[66],"but":[67],"efficient":[68],"utility":[69,85,136],"function":[70,137],"corresponding":[71],"developed.":[78],"Using":[79],"aforementioned":[81],"function,":[86],"two":[87],"optimization":[88,104],"problems":[89,105,122],"w.r.t.":[90],"are":[92,106,124],"formulated":[93],"find":[95],"degree":[98],"distributions.":[99],"show":[101],"that":[102],"both":[103],"convex.":[107],"particular,":[109],"problem":[111,132],"with":[112,133],"proposed":[114,135,166],"belongs":[116],"class":[119,141],"semi-infinite":[121],"which":[123],"computationally":[125],"challenging":[126],"be":[128,152],"solved.":[129],"However,":[130],"falls":[138],"into":[139],"semi-definite":[143],"programming":[144],"(SDP)":[145],"thus,":[147],"global":[149],"solution":[150],"can":[151],"found":[153],"efficiently":[154],"using":[155],"available":[156],"SDP":[157],"solvers.":[158],"Numerical":[159],"results":[160],"reveal":[161],"superiority":[163],"compared":[169],"existing":[171],"designs":[173],"from":[174],"literature.":[175]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-01-29T23:13:10.619473","created_date":"2016-06-24T00:00:00"}