{"id":"https://openalex.org/W2004048693","doi":"https://doi.org/10.1109/istc.2014.6955121","title":"An efficient complexity-optimizing LDPC code design for the binary erasure channel","display_name":"An efficient complexity-optimizing LDPC code design for the binary erasure channel","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2004048693","doi":"https://doi.org/10.1109/istc.2014.6955121","mag":"2004048693"},"language":"en","primary_location":{"id":"doi:10.1109/istc.2014.6955121","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2014.6955121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","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/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":["Friedrich-Alexander-University Erlangen-Ntirnberg (PAU), Erlangen, Germany","Friedrich-Alexander-University Erlangen-N\u00fcrnberg (FAU), Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-University Erlangen-Ntirnberg (PAU), Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Friedrich-Alexander-University Erlangen-N\u00fcrnberg (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":["K. N. Toosi University of Technology (KNTU), Tehran, Iran","K.N. Toosi Univ. of Technol. (KNTU), Tehran, , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"K. N. Toosi University of Technology (KNTU), Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]},{"raw_affiliation_string":"K.N. Toosi Univ. of Technol. (KNTU), 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":["Friedrich-Alexander-University Erlangen-Ntirnberg (PAU), Erlangen, Germany","Friedrich-Alexander-University Erlangen-N\u00fcrnberg (FAU), Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-University Erlangen-Ntirnberg (PAU), Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Friedrich-Alexander-University Erlangen-N\u00fcrnberg (FAU), Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054068025","display_name":"Mahmoud Ahmadian","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","raw_affiliation_strings":["K. N. Toosi University of Technology (KNTU), Tehran, Iran","K.N. Toosi Univ. of Technol. (KNTU), Tehran, , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"K. N. Toosi University of Technology (KNTU), Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]},{"raw_affiliation_string":"K.N. Toosi Univ. of Technol. (KNTU), 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":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":null,"first_page":"238","last_page":"242"},"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.994700014591217,"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.8312155604362488},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7949695587158203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6442875862121582},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6123219132423401},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5547164082527161},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4998338222503662},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.498995304107666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48161977529525757},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47009989619255066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44343283772468567},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.42847931385040283},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42719346284866333},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.381289541721344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2913631200790405},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2332724928855896}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8312155604362488},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7949695587158203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6442875862121582},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6123219132423401},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5547164082527161},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4998338222503662},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.498995304107666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48161977529525757},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47009989619255066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44343283772468567},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.42847931385040283},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42719346284866333},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.381289541721344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2913631200790405},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2332724928855896},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc.2014.6955121","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2014.6955121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","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":16,"referenced_works":["https://openalex.org/W1503221585","https://openalex.org/W1568307856","https://openalex.org/W1965728334","https://openalex.org/W1992687376","https://openalex.org/W2075887074","https://openalex.org/W2110937818","https://openalex.org/W2112826979","https://openalex.org/W2114468914","https://openalex.org/W2125259700","https://openalex.org/W2156055959","https://openalex.org/W2158511475","https://openalex.org/W2158669549","https://openalex.org/W2912673962","https://openalex.org/W6683202485","https://openalex.org/W6683321016","https://openalex.org/W6891669271"],"related_works":["https://openalex.org/W2156055959","https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W1525070854","https://openalex.org/W2137028263","https://openalex.org/W2810502498","https://openalex.org/W2744779861","https://openalex.org/W2951344115"],"abstract_inverted_index":{"The":[0,49],"complexity-performance":[1],"trade-off":[2],"is":[3,108,119],"a":[4,41,84,96],"fundamental":[5],"aspect":[6],"of":[7,10,36,67,90,106,142,164],"the":[8,23,54,57,65,88,93,104,130,134,140,148,162,165],"design":[9,168],"low-density":[11],"parity-check":[12],"(LDPC)":[13],"codes.":[14],"In":[15],"this":[16,79,111],"paper,":[17,80],"we":[18,81],"consider":[19],"LDPC":[20],"codes":[21],"for":[22,31,46,56,92],"binary":[24],"erasure":[25,44],"channel":[26],"(BEC),":[27],"use":[28],"code":[29,124,167,172],"rate":[30],"performance":[32],"metric,":[33],"and":[34,146],"number":[35,89,105],"decoding":[37],"iterations":[38,91,107],"to":[39,64,74,103,121,170],"achieve":[40],"certain":[42],"residual":[43],"probability":[45],"complexity":[47,118],"metric.":[48],"available":[50,156],"complexity-optimizing":[51],"problems":[52,69],"in":[53,78],"literature":[55],"BEC":[58],"are":[59,71],"either":[60],"non-convex":[61],"or":[62],"belong":[63],"class":[66,141],"semi-infinite":[68],"which":[70],"computationally":[72],"challenging":[73],"be":[75,152],"solved.":[76],"Hence,":[77],"first":[82],"propose":[83],"lower":[85],"bound":[86],"on":[87],"BEC.":[94],"Moreover,":[95],"simple":[97],"but":[98],"efficient":[99],"utility":[100,112,136],"function":[101,137],"corresponding":[102],"developed.":[109],"Using":[110],"function,":[113],"an":[114],"optimization":[115],"problem":[116,132],"w.r.t.":[117],"formulated":[120],"find":[122],"complexity-optimized":[123],"degree":[125],"distributions.":[126],"We":[127],"prove":[128],"that":[129],"considered":[131],"with":[133],"proposed":[135,166],"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],"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":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}