{"id":"https://openalex.org/W2058064018","doi":"https://doi.org/10.1109/isit.2007.4557205","title":"Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel","display_name":"Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2058064018","doi":"https://doi.org/10.1109/isit.2007.4557205","mag":"2058064018"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557205","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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/A5102938606","display_name":"Khaled Abdel-Ghaffar","orcid":"https://orcid.org/0000-0002-3128-0557"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khaled A.S. Abdel-Ghaffar","raw_affiliation_strings":["Department ECE, University of California, Davis, CA, USA","Dept. ECE, Univ. of California, Davis, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department ECE, University of California, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Dept. ECE, Univ. of California, Davis, CA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058084781","display_name":"Jos H. Weber","orcid":"https://orcid.org/0000-0002-8333-1301"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jos H. Weber","raw_affiliation_strings":["IRCTR/CWPC, Delft University\uc2a0of\uc2a0Technology, Delft, Netherlands","Delft University of Technology, IRCTR/CWPC, Mekelweg 4, 2628 CD Delft, The Netherlands. Email: j.h.weber@tudelft.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRCTR/CWPC, Delft University\uc2a0of\uc2a0Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, IRCTR/CWPC, Mekelweg 4, 2628 CD Delft, The Netherlands. Email: j.h.weber@tudelft.nl","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1834,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76612261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"66","last_page":"70"},"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.9997000098228455,"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/T11130","display_name":"Coding theory and cryptography","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/decoding-methods","display_name":"Decoding methods","score":0.8322126865386963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6137116551399231},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5931845307350159},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5737096667289734},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5406467914581299},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5350720882415771},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.511277437210083},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5047036409378052},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.47748658061027527},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.42747795581817627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37613826990127563},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.36514005064964294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3522734045982361},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.27396082878112793},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.20716100931167603},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11941486597061157}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8322126865386963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6137116551399231},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5931845307350159},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5737096667289734},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5406467914581299},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5350720882415771},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.511277437210083},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5047036409378052},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.47748658061027527},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.42747795581817627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37613826990127563},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.36514005064964294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3522734045982361},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.27396082878112793},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.20716100931167603},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11941486597061157},{"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/isit.2007.4557205","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1532349793","https://openalex.org/W1793009983","https://openalex.org/W1985305775","https://openalex.org/W2095882513","https://openalex.org/W2100305297","https://openalex.org/W2104345270","https://openalex.org/W2104459449","https://openalex.org/W2111222160","https://openalex.org/W2115104320","https://openalex.org/W2116202986","https://openalex.org/W2125087461","https://openalex.org/W2140227657","https://openalex.org/W2141572292","https://openalex.org/W2164611661","https://openalex.org/W3104554114"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W2140357074","https://openalex.org/W2042522304","https://openalex.org/W2952102465","https://openalex.org/W2104345270","https://openalex.org/W2148484519","https://openalex.org/W2141877208"],"abstract_inverted_index":{"The":[0,40],"generalized":[1,66,91,128],"iterative":[2,17,67,73,92,129,151],"decoding":[3,18,21,130],"concept":[4],"offers":[5],"attractive":[6],"performance":[7,97],"versus":[8],"complexity":[9],"trade-off":[10],"opportunities":[11],"in":[12,48],"the":[13,27,53,56,60,65,71,76,80,85,88,90,95,99,103,115,125,134,141],"spectrum":[14],"between":[15,105],"traditional":[16,72,150],"and":[19,131],"optimal":[20,100],"for":[22,110],"linear":[23],"block":[24],"codes":[25],"over":[26,149],"binary":[28],"erasure":[29],"channel.":[30],"In":[31,58,118],"each":[32],"iteration,":[33],"a":[34,111,138],"system":[35,116],"of":[36,43,55,87,127,140],"equations":[37,44],"is":[38,51,62,82],"solved.":[39],"maximum":[41],"number":[42],"to":[45,70,84,114,147],"be":[46],"solved":[47],"one":[49],"iteration":[50],"called":[52],"order":[54,61,81,104,136],"decoder.":[57,74,101],"case":[59],"just":[63],"one,":[64],"decoder":[68,93],"reduces":[69],"On":[75],"other":[77],"hand,":[78],"if":[79],"set":[83],"redundancy":[86],"codes,":[89],"gives":[94],"same":[96],"as":[98],"Varying":[102],"these":[106],"two":[107],"extremes":[108],"allows":[109],"better":[112],"match":[113],"specifications.":[117],"this":[119],"paper,":[120],"we":[121,132],"consider":[122],"aspects":[123],"regarding":[124],"implementation":[126],"determine":[133],"minimum":[135],"(as":[137],"function":[139],"girth)":[142],"that":[143],"can":[144],"potentially":[145],"lead":[146],"improvement":[148],"decoding.":[152]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}