{"id":"https://openalex.org/W2103456141","doi":"https://doi.org/10.1109/infcom.2009.5061950","title":"An Evolutionary Approach To Inter-Session Network Coding","display_name":"An Evolutionary Approach To Inter-Session Network Coding","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2103456141","doi":"https://doi.org/10.1109/infcom.2009.5061950","mag":"2103456141"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5061950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://mediatum.ub.tum.de/node?id=982007","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072867548","display_name":"M. Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Kim","raw_affiliation_strings":["Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA","Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA","institution_ids":["https://openalex.org/I4210143601"]},{"raw_affiliation_string":"Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075370174","display_name":"Muriel M\u00e9dard","orcid":"https://orcid.org/0000-0003-4059-407X"},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Medard","raw_affiliation_strings":["Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA","Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA","institution_ids":["https://openalex.org/I4210143601"]},{"raw_affiliation_string":"Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000646181","display_name":"Una-May O\u2019Reilly","orcid":"https://orcid.org/0000-0001-6923-8445"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"U.-M. O'Reilly","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036878244","display_name":"Danail Traskov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Traskov","raw_affiliation_strings":["Institute for Communications Engineering, Technical University Munich, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technical University Munich, Munich, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0804,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95551679,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"450","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9921000003814697,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9063000082969666,"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/linear-network-coding","display_name":"Linear network coding","score":0.8814854621887207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7461140751838684},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6441046595573425},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6164795160293579},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5990740656852722},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5186623334884644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4911031723022461},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4730726182460785},{"id":"https://openalex.org/keywords/coding-tree-unit","display_name":"Coding tree unit","score":0.47295495867729187},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4563482701778412},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3648080825805664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27657586336135864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1711057424545288},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16073349118232727}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8814854621887207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7461140751838684},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6441046595573425},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6164795160293579},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5990740656852722},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5186623334884644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4911031723022461},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4730726182460785},{"id":"https://openalex.org/C190750250","wikidata":"https://www.wikidata.org/wiki/Q13533439","display_name":"Coding tree unit","level":3,"score":0.47295495867729187},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4563482701778412},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3648080825805664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27657586336135864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1711057424545288},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16073349118232727},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/infcom.2009.5061950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.2508","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.2508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.di.unito.it/%7Ematteo/I09/DATA09/01-13-03.PDF","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.8494","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.8494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/medard/www/mpapers/anevolutionary.pdf","raw_type":"text"},{"id":"pmh:oai:mediatum.ub.tum.de:node/982007","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=982007","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:mediatum.ub.tum.de:node/982007","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=982007","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W69974971","https://openalex.org/W1515040589","https://openalex.org/W1532718431","https://openalex.org/W1534878308","https://openalex.org/W1912527142","https://openalex.org/W1965124840","https://openalex.org/W1982057359","https://openalex.org/W2016312880","https://openalex.org/W2026482663","https://openalex.org/W2043977911","https://openalex.org/W2048235391","https://openalex.org/W2062698965","https://openalex.org/W2097571405","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2109545390","https://openalex.org/W2132110147","https://openalex.org/W2132123317","https://openalex.org/W2138928022","https://openalex.org/W2152095900","https://openalex.org/W2167513698","https://openalex.org/W2280861269","https://openalex.org/W2325997012","https://openalex.org/W4210424113","https://openalex.org/W6631882945","https://openalex.org/W6645715153","https://openalex.org/W6656936930","https://openalex.org/W7028528039"],"related_works":["https://openalex.org/W2262362834","https://openalex.org/W2083809258","https://openalex.org/W1485515172","https://openalex.org/W1573844898","https://openalex.org/W2104750217","https://openalex.org/W2121576276","https://openalex.org/W2101620528","https://openalex.org/W1997045285","https://openalex.org/W2045024766","https://openalex.org/W2548599468"],"abstract_inverted_index":{"Whereas":[0],"the":[1,13,63,78,83,125],"theory":[2],"and":[3,38,124,155],"application":[4],"of":[5,44,52,59,73,77,85,127,153],"optimal":[6,21],"network":[7,22,60,95],"coding":[8,23,61,79,96,104,111,141,149],"are":[9,33],"well":[10],"studied":[11],"for":[12,25,98],"single-session":[14],"multicast":[15],"scenario,":[16,66],"there":[17,32,47],"is":[18,120,132],"no":[19],"known":[20],"strategy":[24,97,105,142],"a":[26,50,92,99,113],"more":[27,34],"general":[28,100,108],"connection":[29,101],"problem":[30],"where":[31],"than":[35],"one":[36],"session":[37,65],"receivers":[39,123],"may":[40,143],"demand":[41],"different":[42],"sets":[43],"information.":[45],"Though":[46],"have":[48],"been":[49],"number":[51],"recent":[53],"studies":[54],"that":[55],"demonstrate":[56,138],"various":[57],"utilities":[58],"in":[62,75,117,151],"multi-":[64],"they":[67],"rely":[68],"on":[69],"very":[70],"restricted":[71],"classes":[72],"codes":[74],"terms":[76,152],"operations":[80],"allowed":[81],"and/or":[82],"location":[84],"decoding.":[86],"In":[87],"this":[88],"paper,":[89],"we":[90],"propose":[91],"novel":[93],"inter-session":[94],"problem.":[102],"Our":[103],"allows":[106],"fairly":[107],"random":[109],"linear":[110],"over":[112],"large":[114],"finite":[115],"field,":[116],"which":[118],"decoding":[119],"done":[121],"at":[122,129],"mixture":[126],"information":[128],"interior":[130],"nodes":[131],"controlled":[133],"by":[134],"evolutionary":[135],"mechanisms.":[136],"We":[137],"how":[139],"our":[140],"surpass":[144],"existing":[145],"end-to-end":[146],"pairwise":[147],"XOR":[148],"schemes":[150],"effectiveness":[154],"practicality.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}