{"id":"https://openalex.org/W4226219996","doi":"https://doi.org/10.1109/isit50566.2022.9834870","title":"Error-and-erasure Decoding of Product and Staircase Codes with Simplified Extrinsic Message Passing","display_name":"Error-and-erasure Decoding of Product and Staircase Codes with Simplified Extrinsic Message Passing","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4226219996","doi":"https://doi.org/10.1109/isit50566.2022.9834870"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834870","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5057379445","display_name":"Sisi Miao","orcid":"https://orcid.org/0000-0002-3483-7891"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sisi Miao","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT),Communications Engineering Lab (CEL),Karlsruhe,Germany,76187"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT),Communications Engineering Lab (CEL),Karlsruhe,Germany,76187","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077839299","display_name":"Lukas Rapp","orcid":"https://orcid.org/0000-0003-2746-2187"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lukas Rapp","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT),Communications Engineering Lab (CEL),Karlsruhe,Germany,76187"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT),Communications Engineering Lab (CEL),Karlsruhe,Germany,76187","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053280913","display_name":"Laurent Schmalen","orcid":"https://orcid.org/0000-0002-1459-9128"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Laurent Schmalen","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT),Communications Engineering Lab (CEL),Karlsruhe,Germany,76187"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT),Communications Engineering Lab (CEL),Karlsruhe,Germany,76187","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057379445"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":0.6487,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55555556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1205","last_page":"1210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9951000213623047,"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/decoding-methods","display_name":"Decoding methods","score":0.9019540548324585},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7073928117752075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6815059185028076},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6783111095428467},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6160706877708435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6132051348686218},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.46919772028923035},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.46784600615501404},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.43818292021751404},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3551967442035675},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3287905752658844},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2234424352645874},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1773260533809662}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.9019540548324585},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7073928117752075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6815059185028076},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6783111095428467},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6160706877708435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6132051348686218},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.46919772028923035},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.46784600615501404},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.43818292021751404},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3551967442035675},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3287905752658844},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2234424352645874},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1773260533809662},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834870","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2047150880","https://openalex.org/W2074196758","https://openalex.org/W2078486563","https://openalex.org/W2153936403","https://openalex.org/W2653587054","https://openalex.org/W2809957152","https://openalex.org/W2963228998","https://openalex.org/W2972864951","https://openalex.org/W2978648598","https://openalex.org/W3032870283","https://openalex.org/W3047215643","https://openalex.org/W3115550904","https://openalex.org/W3158735576","https://openalex.org/W3163094521","https://openalex.org/W3205155553","https://openalex.org/W4234572373","https://openalex.org/W6788100133"],"related_works":["https://openalex.org/W2156842986","https://openalex.org/W2042522304","https://openalex.org/W2337263547","https://openalex.org/W2142026728","https://openalex.org/W966573063","https://openalex.org/W3010807798","https://openalex.org/W1966180159","https://openalex.org/W1998304763","https://openalex.org/W4226219996","https://openalex.org/W4307695054"],"abstract_inverted_index":{"The":[0],"decoding":[1,13,31,82,97,121,158],"performance":[2,41,159],"of":[3,21,25,114,129,145,160],"product":[4],"codes":[5,8,117],"and":[6,104,118],"staircase":[7],"based":[9,109],"on":[10,110],"iterative":[11],"bounded-distance":[12],"(iBDD)":[14],"can":[15,42],"be":[16,43],"improved":[17],"with":[18,46,137],"the":[19,51,59,68,80,85,95,100,111,115,119,127,146,151,157,161],"aid":[20],"a":[22,29,63,142],"moderate":[23],"amount":[24],"soft":[26],"information,":[27],"maintaining":[28],"low":[30],"complexity.":[32],"One":[33],"promising":[34],"approach":[35],"is":[36,132],"error-and-erasure":[37],"(EaE)":[38],"decoding,":[39],"whose":[40],"reliably":[44],"estimated":[45],"density":[47],"evolution":[48],"(DE).":[49],"However,":[50],"extrinsic":[52],"message":[53,71],"passing":[54,72],"(EMP)":[55],"decoder":[56,102,148,163],"required":[57],"by":[58,93],"DE":[60],"analysis":[61],"entails":[62],"much":[64],"higher":[65],"complexity":[66,152],"than":[67],"simple":[69],"intrinsic":[70],"(IMP)":[73],"decoder.":[74],"In":[75,154],"this":[76],"paper,":[77],"we":[78,140],"simplify":[79],"EMP":[81,96,147,173],"algorithm":[83],"for":[84,88],"EaE":[86,91,120],"channel":[87],"two":[89],"commonly-used":[90],"decoders":[92],"deriving":[94],"results":[98,124],"from":[99],"IMP":[101],"output":[103],"some":[105],"additional":[106],"logical":[107],"operations":[108],"algebraic":[112],"structure":[113],"component":[116],"rule.":[122],"Simulation":[123],"show":[125],"that":[126,149],"number":[128],"BDD":[130],"steps":[131],"reduced":[133],"to":[134,166,171],"being":[135],"comparable":[136],"IMP.":[138],"Furthermore,":[139],"propose":[141],"heuristic":[143],"modification":[144],"reduces":[150],"further.":[153],"numerical":[155],"simulations,":[156],"modified":[162],"yields":[164],"up":[165],"0.2":[167],"dB":[168],"improvement":[169],"compared":[170],"standard":[172],"decoding.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}