{"id":"https://openalex.org/W2095686445","doi":"https://doi.org/10.1109/isit.2008.4594979","title":"Separating erasures from errors for decoding","display_name":"Separating erasures from errors for decoding","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2095686445","doi":"https://doi.org/10.1109/isit.2008.4594979","mag":"2095686445"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4594979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4594979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 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 of Technnology, Delft, Netherlands","Delft University of Technology, IRCTR/CWPC, Mekelweg 4, 2628 CD, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRCTR CWPC, Delft University of Technnology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, IRCTR/CWPC, Mekelweg 4, 2628 CD, The Netherlands","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":0.5036,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.60206867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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"}},{"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994000196456909,"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.8570756912231445},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6961203217506409},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6006535291671753},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.5893058180809021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5756210684776306},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.49458953738212585},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4839904308319092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48303088545799255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4768456220626831},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.46203234791755676},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4516812562942505},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.42012161016464233},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.4171731770038605},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.374616414308548},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.33984947204589844}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8570756912231445},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6961203217506409},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6006535291671753},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.5893058180809021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5756210684776306},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.49458953738212585},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4839904308319092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48303088545799255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4768456220626831},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.46203234791755676},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4516812562942505},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.42012161016464233},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.4171731770038605},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.374616414308548},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.33984947204589844},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2008.4594979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4594979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 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":12,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1895967008","https://openalex.org/W1992987852","https://openalex.org/W2095882513","https://openalex.org/W2104459449","https://openalex.org/W2115104320","https://openalex.org/W2125087461","https://openalex.org/W2140227657","https://openalex.org/W2172152579","https://openalex.org/W2182112064","https://openalex.org/W2895239415","https://openalex.org/W3104554114"],"related_works":["https://openalex.org/W2061476814","https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W4210406383","https://openalex.org/W99853930","https://openalex.org/W2127999627","https://openalex.org/W4303471944","https://openalex.org/W2744658369","https://openalex.org/W2160839632","https://openalex.org/W2010879611"],"abstract_inverted_index":{"Most":[0],"decoding":[1,26,39],"algorithms":[2],"of":[3,59,74,92,99,117],"linear":[4,52],"codes,":[5],"in":[6,20],"general,":[7],"are":[8,80],"designed":[9],"to":[10,22,45,82,88,103],"correct":[11],"or":[12],"detect":[13],"errors.":[14,23],"However,":[15],"many":[16],"channels":[17,29],"cause":[18],"erasures":[19,100],"addition":[21],"In":[24],"principle,":[25],"over":[27],"such":[28,118],"can":[30],"be":[31],"accomplished":[32],"by":[33],"deleting":[34],"the":[35,40,75,97],"erased":[36,76],"symbols":[37,77],"and":[38,54,78,120],"resulting":[41],"vector":[42],"with":[43],"respect":[44],"a":[46],"punctured":[47,85],"code.":[48],"For":[49],"any":[50,55,73],"given":[51,56],"code":[53],"maximum":[57,90],"number":[58,91],"correctable":[60],"erasures,":[61],"we":[62],"introduce":[63],"parity-check":[64,67,107],"matrices":[65,108,119],"yielding":[66],"equations":[68],"that":[69],"do":[70],"not":[71],"check":[72],"which":[79],"sufficient":[81],"characterize":[83],"all":[84],"codes":[86],"corresponding":[87],"this":[89],"erasures.":[93],"This":[94],"allows":[95],"for":[96],"separation":[98],"from":[101],"errors":[102],"facilitate":[104],"decoding.":[105],"The":[106],"typically":[109],"have":[110],"redundant":[111],"rows.":[112],"We":[113],"give":[114],"several":[115],"constructions":[116],"prove":[121],"general":[122],"bounds":[123],"on":[124],"their":[125],"minimum":[126],"sizes.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}