{"id":"https://openalex.org/W1883724302","doi":"https://doi.org/10.1109/isit.2015.7282942","title":"Asynchronous decoding of LDPC codes over BEC","display_name":"Asynchronous decoding of LDPC codes over BEC","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1883724302","doi":"https://doi.org/10.1109/isit.2015.7282942","mag":"1883724302"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282942","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/record/204945/files/Asynchronous%20Decoding%20of%20LDPC%20Codes%20over%20BEC.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034537543","display_name":"Saeid Haghighatshoar","orcid":"https://orcid.org/0000-0002-9063-3105"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Saeid Haghighatshoar","raw_affiliation_strings":["Department of Telecommunication Systems, Technische Universit\u00e4t Berlin, Germany","[Department of Telecommunication Systems, Technische Universit\u00e4t Berlin, Germany]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunication Systems, Technische Universit\u00e4t Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"[Department of Telecommunication Systems, Technische Universit\u00e4t Berlin, Germany]","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020548562","display_name":"Amin Karbasi","orcid":"https://orcid.org/0000-0002-5898-0289"},"institutions":[{"id":"https://openalex.org/I4210161331","display_name":"Applied Sciences (United States)","ror":"https://ror.org/04zd6dy90","country_code":"US","type":"company","lineage":["https://openalex.org/I4210161331"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amin Karbasi","raw_affiliation_strings":["School of Engineering and Applied Sciences, Yale, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Yale, USA","institution_ids":["https://openalex.org/I4210161331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050441799","display_name":"Amir Hesam Salavati","orcid":"https://orcid.org/0000-0003-2680-5408"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Amir Hesam Salavati","raw_affiliation_strings":["School of Computer and Communication Sciences, Switzerland","School of Computer and Communication Sciences EPFL, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, Switzerland","institution_ids":[]},{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL, Switzerland#TAB#","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"2678","last_page":"2682"},"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/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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.8302891254425049},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7551347613334656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7495124936103821},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.71346515417099},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6167728304862976},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.6147477626800537},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5568705201148987},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.49212735891342163},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4476975202560425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3883287310600281},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34428325295448303},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.263283371925354},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2534802556037903},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.20097512006759644},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.09427523612976074}],"concepts":[{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.8302891254425049},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7551347613334656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7495124936103821},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.71346515417099},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6167728304862976},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6147477626800537},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5568705201148987},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.49212735891342163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4476975202560425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3883287310600281},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34428325295448303},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.263283371925354},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2534802556037903},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.20097512006759644},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.09427523612976074}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2015.7282942","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.tind.io:204945","is_oa":true,"landing_page_url":"https://github.com/saloot/AsynchronousBP/tree/master/ErasureDecoder","pdf_url":"https://infoscience.epfl.ch/record/204945/files/Asynchronous%20Decoding%20of%20LDPC%20Codes%20over%20BEC.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"},{"id":"pmh:oai:infoscience.epfl.ch:204945","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/204945","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:204945","is_oa":true,"landing_page_url":"https://github.com/saloot/AsynchronousBP/tree/master/ErasureDecoder","pdf_url":"https://infoscience.epfl.ch/record/204945/files/Asynchronous%20Decoding%20of%20LDPC%20Codes%20over%20BEC.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1883724302.pdf","grobid_xml":"https://content.openalex.org/works/W1883724302.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W568057840","https://openalex.org/W1518608438","https://openalex.org/W1525888637","https://openalex.org/W1536930200","https://openalex.org/W1956376585","https://openalex.org/W1966336366","https://openalex.org/W2044607510","https://openalex.org/W2101147641","https://openalex.org/W2128765501","https://openalex.org/W2137813581","https://openalex.org/W2144671002","https://openalex.org/W2159080219","https://openalex.org/W2160988325","https://openalex.org/W2169732368","https://openalex.org/W2172679141","https://openalex.org/W3125530803","https://openalex.org/W3139815204","https://openalex.org/W6631424144","https://openalex.org/W6640661406","https://openalex.org/W6675326518"],"related_works":["https://openalex.org/W2885795561","https://openalex.org/W2156055959","https://openalex.org/W2011305240","https://openalex.org/W2050010277","https://openalex.org/W1525070854","https://openalex.org/W3125437229","https://openalex.org/W2949904577","https://openalex.org/W2896991873","https://openalex.org/W2163364417","https://openalex.org/W2336199159"],"abstract_inverted_index":{"LDPC":[0,84,117],"codes":[1,118],"are":[2,90,164],"typically":[3],"decoded":[4],"by":[5,197],"running":[6],"a":[7,120,131,149,155,161,171,198],"synchronous":[8,27],"message":[9,75,111,150,173,192],"passing":[10,76,112,193],"algorithm":[11],"over":[12,119],"the":[13,38,42,46,54,59,66,95,107,114,139,144,152,157,180,186,190,208,211,215,224,245,252],"corresponding":[14],"bipartite":[15],"factor":[16,140,216],"graph":[17,141],"(made":[18],"of":[19,30,83,109,116,138,148,160,170,189,214,223],"variable":[20,34,63],"and":[21,49,92,210],"check":[22,43,55],"nodes).":[23],"More":[24],"specifically,":[25],"each":[26,136],"round":[28],"consists":[29],"1)":[31],"updating":[32,52],"all":[33,53,88],"nodes":[35,44,56,64],"based":[36,57],"on":[37,58,113],"information":[39,60],"received":[40,93],"from":[41,62,74,100],"in":[45,65,70,77,174,228,248,251],"previous":[47],"round,":[48],"then":[50],"2)":[51],"sent":[61,91],"current":[67],"round.":[68],"However,":[69],"many":[71],"applications,":[72],"ranging":[73],"neural":[78],"networks":[79],"to":[80,135,244],"hardware":[81],"implementation":[82],"codes,":[85],"assuming":[86],"that":[87,128,142,185,203,237],"messages":[89,159],"at":[94],"same":[96],"time":[97,182,242],"is":[98,130,194,221],"far":[99],"realistic.":[101],"In":[102],"this":[103],"paper,":[104],"we":[105],"investigate":[106],"effect":[108],"asynchronous":[110,191,238],"decoding":[115,241],"Binary":[121],"Erasure":[122],"Channel":[123],"(BEC).":[124],"We":[125,177],"effectively":[126],"assume":[127],"there":[129],"random":[132,145],"delay":[133,147],"assigned":[134],"edge":[137],"models":[143],"propagation":[146],"along":[151],"edge.":[153],"As":[154],"result,":[156],"output":[158],"check/variable":[162],"node":[163],"also":[165],"asynchronously":[166],"updated":[167],"upon":[168],"arrival":[169],"new":[172],"its":[175],"input.":[176],"show,":[178],"for":[179,183],"first":[181],"BEC,":[184],"asymptotic":[187],"performance":[188],"fully":[195],"characterized":[196],"fixed":[199,225],"point":[200,226],"integral":[201],"equation":[202,227],"takes":[204],"into":[205],"account":[206],"both":[207],"temporal":[209],"spatial":[212],"features":[213],"graph.":[217],"Our":[218],"theoretical":[219],"result":[220],"reminiscent":[222],"traditional":[229,246],"BP":[230,247],"decoding.":[231],"Also,":[232],"our":[233],"simulation":[234],"results":[235],"show":[236],"scheduling":[239],"reduces":[240],"compared":[243],"certain":[249],"cases":[250],"finite":[253],"block-length":[254],"regime.":[255]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}