{"id":"https://openalex.org/W4289655335","doi":"https://doi.org/10.1109/isit50566.2022.9834704","title":"On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network","display_name":"On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655335","doi":"https://doi.org/10.1109/isit50566.2022.9834704"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834704","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/A5004459415","display_name":"Gustavo Kasper Facenda","orcid":"https://orcid.org/0000-0002-5439-1348"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gustavo Kasper Facenda","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074016554","display_name":"Elad Domanovitz","orcid":"https://orcid.org/0000-0003-0503-9089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elad Domanovitz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056042146","display_name":"M. Nikhil Krishnan","orcid":"https://orcid.org/0000-0003-0089-676X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M Nikhil Krishnan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046253142","display_name":"Ashish Khisti","orcid":"https://orcid.org/0000-0002-2331-8965"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ashish Khisti","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081121300","display_name":"Silas L. Fong","orcid":"https://orcid.org/0000-0002-8762-5294"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silas L. Fong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110256765","display_name":"Wai-Tian Tan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wai-Tian Tan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111370293","display_name":"John Apostolopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John Apostolopoulos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5004459415"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6479,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57577864,"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":"1951","last_page":"1956"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T11321","display_name":"Error Correcting Code Techniques","score":0.9962999820709229,"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/T11478","display_name":"Caching and Content Delivery","score":0.9952999949455261,"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/relay","display_name":"Relay","score":0.8517862558364868},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.7224113345146179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7211183905601501},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6807227730751038},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6541179418563843},{"id":"https://openalex.org/keywords/relay-channel","display_name":"Relay channel","score":0.6021705865859985},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5309904217720032},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.4762054681777954},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.45061224699020386},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.352720707654953},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.30914121866226196},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.29264506697654724},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.21326404809951782},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.14264926314353943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13031348586082458},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.08889627456665039},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06649965047836304}],"concepts":[{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.8517862558364868},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.7224113345146179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7211183905601501},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6807227730751038},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6541179418563843},{"id":"https://openalex.org/C46257984","wikidata":"https://www.wikidata.org/wiki/Q7310895","display_name":"Relay channel","level":4,"score":0.6021705865859985},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5309904217720032},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.4762054681777954},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.45061224699020386},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.352720707654953},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.30914121866226196},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.29264506697654724},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.21326404809951782},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.14264926314353943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13031348586082458},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.08889627456665039},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06649965047836304},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834704","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W67291757","https://openalex.org/W2015912927","https://openalex.org/W2031335939","https://openalex.org/W2078724035","https://openalex.org/W2113967464","https://openalex.org/W2125921054","https://openalex.org/W2143354094","https://openalex.org/W2735002564","https://openalex.org/W2761089354","https://openalex.org/W2913533115","https://openalex.org/W2914480035","https://openalex.org/W2963225233","https://openalex.org/W2972440601","https://openalex.org/W3006325173","https://openalex.org/W3081071837","https://openalex.org/W3100552666","https://openalex.org/W3215828111","https://openalex.org/W4288415852","https://openalex.org/W6602757234","https://openalex.org/W6760743677"],"related_works":["https://openalex.org/W2501473353","https://openalex.org/W2098206536","https://openalex.org/W2963693149","https://openalex.org/W3004923477","https://openalex.org/W2139801379","https://openalex.org/W2387096116","https://openalex.org/W2272554646","https://openalex.org/W2066422082","https://openalex.org/W2945203537","https://openalex.org/W4289655335"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"low-latency":[3],"adaptive":[4],"streaming":[5],"codes":[6],"for":[7],"a":[8,16,26,32,98,123,160],"three-node":[9],"relay":[10,27,42,52,59,199],"network.":[11],"A":[12],"source":[13,19,40,74,88,151],"node":[14,60,75,200],"transmits":[15],"sequence":[17],"of":[18,107,125,193],"packets":[20],"(messages)":[21],"to":[22,53,152,183],"the":[23,36,39,48,51,54,63,70,73,95,105,110,148,167,176,191,194,198],"destination":[24,55,96],"through":[25],"node.":[28],"We":[29,118,173],"focus":[30],"on":[31,84,138],"particular":[33],"case":[34],"where":[35],"link":[37,49,112,149],"connecting":[38,50],"and":[41,76,78,164],"nodes":[43],"is":[44,56,156,201],"almost":[45],"reliable,":[46],"but":[47],"not.":[57],"The":[58,129,154],"can":[61,179],"observe":[62],"erasure":[64,141,162,195],"pattern":[65,163,196],"that":[66,85,175,189],"has":[67,142,144],"occurred":[68,146],"in":[69,109,147,203],"transmission":[71],"between":[72],"itself":[77],"adapt":[79],"its":[80],"relaying":[81,135],"strategy":[82],"based":[83,137],"observation.":[86],"Every":[87],"packet":[89],"must":[90],"be":[91,180],"perfectly":[92],"recovered":[93],"by":[94,158,197],"with":[97],"strict":[99],"delay":[100],"T,":[101],"as":[102,104,122],"long":[103],"number":[106],"erasures":[108],"relay-to-destination":[111],"lies":[113],"below":[114],"some":[115],"design":[116,127],"parameter.":[117,128],"then":[119],"characterize":[120],"capacity":[121],"function":[124],"such":[126],"achievability":[130],"scheme":[131],"employs":[132],"two":[133],"different":[134],"strategies,":[136],"whether":[139],"an":[140],"or":[143],"not":[145],"from":[150],"relay.":[153],"converse":[155],"proven":[157],"analyzing":[159],"periodic":[161],"lower":[165],"bounding":[166],"minimum":[168],"redundancy":[169],"across":[170],"channel":[171],"packets.":[172],"show":[174],"achievable":[177],"rate":[178],"improved":[181],"compared":[182],"non-adaptive":[184],"schemes":[185],"previously":[186],"proposed,":[187],"indicating":[188],"exploiting":[190],"knowledge":[192],"essential":[202],"achieving":[204],"capacity.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}