{"id":"https://openalex.org/W2801417378","doi":"https://doi.org/10.1109/isit.2018.8437808","title":"A Systematic Approach to Incremental Redundancy over Erasure Channels","display_name":"A Systematic Approach to Incremental Redundancy over Erasure Channels","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2801417378","doi":"https://doi.org/10.1109/isit.2018.8437808","mag":"2801417378"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437808","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1805.03235","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Anoosheh Heidarzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anoosheh Heidarzadeh","raw_affiliation_strings":["Texas A&M University, Department of Electrical and Computer Engineering, College Station, TX, 77843, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, Department of Electrical and Computer Engineering, College Station, TX, 77843, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jean-Francois Chamberland","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean-Francois Chamberland","raw_affiliation_strings":["Texas A&M University, Department of Electrical and Computer Engineering, College Station, TX, 77843, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, Department of Electrical and Computer Engineering, College Station, TX, 77843, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Parimal Parag","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Parimal Parag","raw_affiliation_strings":["Indian Institute of Science, Department of Electrical Communication Engineering, Bengaluru, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Department of Electrical Communication Engineering, Bengaluru, India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":null,"display_name":"Richard D. Wesel","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard D. Wesel","raw_affiliation_strings":["University of California, Department of Electrical Engineering, Los Angeles, CA, 90095, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Department of Electrical Engineering, Los Angeles, CA, 90095, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.5852,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70794882,"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":"1176","last_page":"1180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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.9994999766349792,"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/T12146","display_name":"Power Line Communications and Noise","score":0.9944000244140625,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.991100013256073,"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/hybrid-automatic-repeat-request","display_name":"Hybrid automatic repeat request","score":0.8460999727249146},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6944000124931335},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.649399995803833},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5406000018119812},{"id":"https://openalex.org/keywords/automatic-repeat-request","display_name":"Automatic repeat request","score":0.5108000040054321},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.47780001163482666},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.41429999470710754},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.41130000352859497},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.39820000529289246}],"concepts":[{"id":"https://openalex.org/C118437007","wikidata":"https://www.wikidata.org/wiki/Q1017139","display_name":"Hybrid automatic repeat request","level":3,"score":0.8460999727249146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7172999978065491},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6944000124931335},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.649399995803833},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5406000018119812},{"id":"https://openalex.org/C171952454","wikidata":"https://www.wikidata.org/wiki/Q29522","display_name":"Automatic repeat request","level":4,"score":0.5108000040054321},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.47780001163482666},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.41130000352859497},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.39820000529289246},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3691999912261963},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.3659000098705292},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C91739489","wikidata":"https://www.wikidata.org/wiki/Q7447752","display_name":"Selective Repeat ARQ","level":5,"score":0.32600000500679016},{"id":"https://openalex.org/C557945733","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Data transmission","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C2983848023","wikidata":"https://www.wikidata.org/wiki/Q733553","display_name":"Transmission channel","level":3,"score":0.29760000109672546},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29019999504089355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28700000047683716},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.28439998626708984},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.2840000092983246},{"id":"https://openalex.org/C175850338","wikidata":"https://www.wikidata.org/wiki/Q1709294","display_name":"Go-Back-N ARQ","level":5,"score":0.2694000005722046},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.26820001006126404},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2018.8437808","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1805.03235","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.03235","pdf_url":"https://arxiv.org/pdf/1805.03235","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1805.03235","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.03235","pdf_url":"https://arxiv.org/pdf/1805.03235","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1781667448","https://openalex.org/W1919404870","https://openalex.org/W1963911146","https://openalex.org/W2038313527","https://openalex.org/W2106864314","https://openalex.org/W2129680301","https://openalex.org/W2134746921","https://openalex.org/W2136138595","https://openalex.org/W2141021549","https://openalex.org/W2282248981","https://openalex.org/W2744248483","https://openalex.org/W2963825951"],"related_works":[],"abstract_inverted_index":{"As":[0],"sensing":[1],"and":[2,14,89,134,144],"instrumentation":[3],"play":[4],"an":[5],"increasingly":[6],"important":[7],"role":[8],"in":[9],"systems":[10],"controlled":[11],"over":[12,75],"wired":[13],"wireless":[15],"networks,":[16],"the":[17,34,51,82,85,90,93,113,122],"need":[18],"to":[19,47,67,95,140],"better":[20],"understand":[21],"delay-sensitive":[22],"communication":[23],"becomes":[24],"a":[25,44,60,137],"prime":[26],"issue.":[27],"Along":[28],"these":[29],"lines,":[30],"this":[31,57],"article":[32],"studies":[33],"operation":[35],"of":[36,53,84,92,115,121],"data":[37],"links":[38],"that":[39,81],"employ":[40],"incremental":[41,123,147],"redundancy":[42],"as":[43],"practical":[45],"means":[46,139],"protect":[48],"information":[49],"from":[50],"effects":[52],"unreliable":[54],"channels.":[55,77],"Specifically,":[56],"work":[58],"extends":[59],"powerful":[61],"methodology":[62],"termed":[63],"sequential":[64],"differential":[65],"optimization":[66],"choose":[68],"near-optimal":[69],"block":[70,104],"sizes":[71],"for":[72,146],"hybrid":[73,132],"ARQ":[74,133],"erasure":[76],"Furthermore,":[78],"results":[79],"show":[80],"impact":[83],"coding":[86],"strategy":[87],"adopted":[88],"propensity":[91],"channel":[94],"erase":[96],"symbols":[97],"naturally":[98],"decouple":[99],"when":[100],"analyzing":[101],"throughput.":[102],"Overall,":[103],"size":[105],"selection":[106],"is":[107],"motivated":[108],"by":[109],"normal":[110],"approximations":[111],"on":[112],"probability":[114],"decoding":[116],"success":[117],"at":[118],"every":[119],"stage":[120],"transmission":[124],"process.":[125],"This":[126],"novel":[127],"perspective,":[128],"which":[129],"rigorously":[130],"bridges":[131],"coding,":[135],"offers":[136],"pragmatic":[138],"select":[141],"code":[142],"rates":[143],"blocklengths":[145],"redundancy.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2018-05-17T00:00:00"}