{"id":"https://openalex.org/W1969374346","doi":"https://doi.org/10.1109/isit.2014.6874956","title":"Sending perishable information: Coding improves delay-constrained throughput even for single unicast","display_name":"Sending perishable information: Coding improves delay-constrained throughput even for single unicast","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W1969374346","doi":"https://doi.org/10.1109/isit.2014.6874956","mag":"1969374346"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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/A5006311047","display_name":"Chih-Chun Wang","orcid":"https://orcid.org/0000-0002-1685-820X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chih-Chun Wang","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, USA","Sch. of Electr. & Comput. engineering, Purdue Univ., West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]},{"raw_affiliation_string":"Sch. of Electr. & Comput. engineering, Purdue Univ., West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100602652","display_name":"Minghua Chen","orcid":"https://orcid.org/0000-0003-4763-0037"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Minghua Chen","raw_affiliation_strings":["Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong","[Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China]"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"[Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China]","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006311047"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.8673,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91192335,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"866","last_page":"870"},"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9686999917030334,"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.9648000001907349,"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/unicast","display_name":"Unicast","score":0.9693707227706909},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6864607930183411},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6773808598518372},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6050992012023926},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5040156245231628},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4928629398345947},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4747893214225769},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.47100889682769775},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4342464506626129},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42414921522140503},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4174855351448059},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3246747851371765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26320159435272217},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.24418097734451294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23950928449630737},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19760257005691528},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11671975255012512},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.10027560591697693},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.09216552972793579}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.9693707227706909},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6864607930183411},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6773808598518372},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6050992012023926},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5040156245231628},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4928629398345947},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4747893214225769},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.47100889682769775},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4342464506626129},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42414921522140503},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4174855351448059},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3246747851371765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26320159435272217},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.24418097734451294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23950928449630737},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19760257005691528},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11671975255012512},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.10027560591697693},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.09216552972793579},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2014.6874956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.8666","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.8666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://home.ie.cuhk.edu.hk/~mhchen/papers/coding.improves.delay.constrained.throughput.ISIT.14.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.714.6926","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.6926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://engineering.purdue.edu/%7Echihw/pub_pdf/14C_ISIT_DC_unicast.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321019","display_name":"University Grants Committee","ror":"https://ror.org/00djwmt25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1984595105","https://openalex.org/W2048235391","https://openalex.org/W2072475112","https://openalex.org/W2097651478","https://openalex.org/W2106403318","https://openalex.org/W2121205191","https://openalex.org/W2141789914","https://openalex.org/W2149746680","https://openalex.org/W2167703619","https://openalex.org/W2542298476","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2794998165","https://openalex.org/W2962934782","https://openalex.org/W1982696243","https://openalex.org/W1997326586","https://openalex.org/W2138841883","https://openalex.org/W148846283","https://openalex.org/W2303790217","https://openalex.org/W2164280516","https://openalex.org/W1984617503","https://openalex.org/W4229782249"],"abstract_inverted_index":{"We":[0,79],"consider":[1],"a":[2,7,14,18,24,191],"delay-constrained":[3,83],"unicast":[4,85,102,147,198],"scenario,":[5],"where":[6,69,175],"source":[8,44],"node":[9,16],"streams":[10],"perishable":[11],"information":[12,39],"to":[13,23,51,157,167,205],"destination":[15,58],"over":[17,186],"directed":[19],"acyclic":[20],"graph":[21],"subject":[22],"delay":[25],"constraint.":[26],"Transmission":[27],"along":[28],"any":[29],"edge":[30],"incurs":[31],"unit":[32],"delay,":[33],"and":[34,54,108,149,201,229],"we":[35,127,189],"require":[36],"that":[37,98,133,181,218],"every":[38],"bit":[40],"generated":[41],"at":[42],"the":[43,46,57,60,74,81,99,112,129,145,150,168,176,196,206,225],"in":[45,59,159,164],"beginning":[47],"of":[48,62],"time":[49,63],"t":[50,64],"be":[52,106,154],"received":[53],"recovered":[55],"by":[56],"end":[61],"+":[65],"D":[66,70],"-":[67],"1":[68],">":[71],"0":[72],"is":[73,91,122,163,221],"maximum":[75],"allowed":[76],"communication":[77,220],"delay.":[78],"study":[80],"corresponding":[82],"(d-cn)":[84],"capacity":[86,104,114,200],"problem.":[87],"When":[88],"only":[89],"routing":[90,103,142],"allowed,":[92],"[Ying,":[93,210],"et":[94,211],"al.":[95,212],"2011]":[96],"showed":[97],"aforementioned":[100],"d-cn":[101,113,139,197,219],"can":[105,135,153],"characterized":[107],"computed":[109],"efficiently.":[110],"However,":[111],"problem":[115],"changes":[116],"completely":[117],"when":[118],"network":[119],"coding":[120,182],"(NC)":[121],"allowed.":[123],"In":[124],"this":[125],"work,":[126],"construct":[128],"first":[130],"example":[131],"showing":[132],"NC":[134,151,199],"achieve":[136],"strictly":[137],"higher":[138],"throughput":[140,185],"than":[141],"even":[143],"for":[144,231],"single":[146],"setting":[148],"gain":[152],"arbitrarily":[155],"close":[156],"2":[158],"some":[160],"instances.":[161],"This":[162],"sharp":[165],"contrast":[166],"delay-unconstrained":[169,227],"(D":[170],"\u2192":[171],"\u221e)":[172],"single-unicast":[173],"case":[174],"classic":[177],"min-cut/max-flow":[178],"theorem":[179],"implies":[180],"cannot":[183],"improve":[184],"routing.":[187],"Finally,":[188],"propose":[190],"new":[192],"upper":[193],"bound":[194],"on":[195],"elaborate":[202],"its":[203],"connections":[204],"existing":[207],"routing-based":[208],"results":[209,216],"2011].":[213],"Overall,":[214],"our":[215],"suggest":[217],"fundamentally":[222],"different":[223],"from":[224],"well-understood":[226],"one":[228],"call":[230],"investigation":[232],"participation.":[233]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}