{"id":"https://openalex.org/W4401692380","doi":"https://doi.org/10.1109/isit57864.2024.10619539","title":"Subset Adaptive Relaying for Streaming Erasure Codes","display_name":"Subset Adaptive Relaying for Streaming Erasure Codes","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401692380","doi":"https://doi.org/10.1109/isit57864.2024.10619539"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619539","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5073405785","display_name":"Muhammad Ahmad Kaleem","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Muhammad Ahmad Kaleem","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004459415","display_name":"Gustavo Kasper Facenda","orcid":"https://orcid.org/0000-0002-5439-1348"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Gustavo Kasper Facenda","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046253142","display_name":"Ashish Khisti","orcid":"https://orcid.org/0000-0002-2331-8965"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ashish Khisti","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073405785"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":1.0958,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78675654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1997","last_page":"2002"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9986000061035156,"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/T11478","display_name":"Caching and Content Delivery","score":0.9986000061035156,"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.9972000122070312,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7886161804199219},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.7036325931549072},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6874023675918579},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.5451653599739075},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.48101574182510376},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.28910839557647705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21524617075920105},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17769268155097961},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10942935943603516},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.1005975604057312}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7886161804199219},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.7036325931549072},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6874023675918579},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.5451653599739075},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.48101574182510376},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28910839557647705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21524617075920105},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17769268155097961},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10942935943603516},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.1005975604057312}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619539","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2130518071","https://openalex.org/W3102119340","https://openalex.org/W2744779861","https://openalex.org/W2982181605","https://openalex.org/W2031335939","https://openalex.org/W1989156844","https://openalex.org/W2004376844","https://openalex.org/W2137028263","https://openalex.org/W969204977","https://openalex.org/W2951344115"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"adaptive":[3,63,79,87,108],"streaming":[4],"codes":[5,80],"over":[6,151],"a":[7,14,17,23,26,46,106,121],"three-node":[8],"relayed":[9],"network.":[10],"In":[11],"this":[12,73],"setting,":[13],"source":[15],"transmits":[16],"sequence":[18],"of":[19,29,48,116,134],"message":[20],"packets":[21],"through":[22],"relay":[24],"under":[25],"delay":[27],"constraint":[28],"<tex":[30,49,53],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[31,50,54],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$T$</tex>":[32],"time":[33],"slots":[34],"per":[35],"packet.":[36],"The":[37],"source-to-relay":[38],"and":[39,44,52,66,75,138,142],"relay-to-destination":[40],"links":[41],"are":[42],"unreliable":[43],"introduce":[45],"maximum":[47],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N_{1}$</tex>":[51],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N_{2}$</tex>":[55],"packet":[56,148],"erasures":[57],"respectively.":[58],"Recent":[59],"work":[60],"has":[61,76],"proposed":[62],"(time":[64,68],"variant)":[65],"nonadaptive":[67],"invariant)":[69],"code":[70,97,109],"constructions":[71],"for":[72],"setting":[74],"shown":[77],"that":[78],"can":[81],"achieve":[82],"higher":[83],"rates.":[84,127],"However,":[85],"the":[86,114,117,125,135],"construction":[88,110,131],"deals":[89],"with":[90,98,119],"many":[91],"possibilities,":[92],"leading":[93],"to":[94,124,146],"an":[95],"impractical":[96],"very":[99],"large":[100],"block":[101],"lengths.":[102],"We":[103,128],"therefore":[104],"propose":[105],"simplified":[107],"which":[111],"greatly":[112],"improves":[113],"practicality":[115],"code,":[118],"only":[120],"small":[122],"cost":[123],"achievable":[126,136],"analyze":[129],"our":[130],"in":[132],"terms":[133],"rates":[137],"field":[139],"size":[140],"requirements,":[141],"perform":[143],"numerical":[144],"simulations":[145],"estimate":[147],"loss":[149],"probabilities":[150],"statistical":[152],"channels.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}
