{"id":"https://openalex.org/W1973783459","doi":"https://doi.org/10.1109/netcod.2013.6570838","title":"Strategic network coding — How much and where to code to obtain most of the benefits","display_name":"Strategic network coding — How much and where to code to obtain most of the benefits","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1973783459","doi":"https://doi.org/10.1109/netcod.2013.6570838","mag":"1973783459"},"language":"en","primary_location":{"id":"doi:10.1109/netcod.2013.6570838","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2013.6570838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","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/A5000879568","display_name":"\u00c9ric Gourdin","orcid":null},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Eric Gourdin","raw_affiliation_strings":["France T\u00e9l\u00e9com, Orange Laboratories, Issy-les-Moulineaux, France","France Telecom, Orange Labs., Issy-Les-Moulineaux, France"],"affiliations":[{"raw_affiliation_string":"France T\u00e9l\u00e9com, Orange Laboratories, Issy-les-Moulineaux, France","institution_ids":["https://openalex.org/I19370010"]},{"raw_affiliation_string":"France Telecom, Orange Labs., Issy-Les-Moulineaux, France","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100330367","display_name":"Yuhui Wang","orcid":"https://orcid.org/0000-0003-3748-3723"},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yuhui Wang","raw_affiliation_strings":["France T\u00e9l\u00e9com, Orange Laboratories, Issy-les-Moulineaux, France","France Telecom, Orange Labs., Issy-Les-Moulineaux, France"],"affiliations":[{"raw_affiliation_string":"France T\u00e9l\u00e9com, Orange Laboratories, Issy-les-Moulineaux, France","institution_ids":["https://openalex.org/I19370010"]},{"raw_affiliation_string":"France Telecom, Orange Labs., Issy-Les-Moulineaux, France","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075370174","display_name":"Muriel M\u00e9dard","orcid":"https://orcid.org/0000-0003-4059-407X"},"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":"Muriel Medard","raw_affiliation_strings":["Research Laboratory for Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","Res. Lab. for Electron., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Research Laboratory for Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Res. Lab. for Electron., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000879568"],"corresponding_institution_ids":["https://openalex.org/I19370010"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08745606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"52","issue":null,"first_page":"1","last_page":"7"},"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.9718000292778015,"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/linear-network-coding","display_name":"Linear network coding","score":0.8897385597229004},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.8575044870376587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7811563014984131},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6384639739990234},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5545526742935181},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32795578241348267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1222495436668396}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8897385597229004},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8575044870376587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7811563014984131},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6384639739990234},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5545526742935181},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32795578241348267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1222495436668396},{"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":1,"locations":[{"id":"doi:10.1109/netcod.2013.6570838","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2013.6570838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","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/W1833312001","https://openalex.org/W1886256924","https://openalex.org/W2048235391","https://openalex.org/W2105831729","https://openalex.org/W2119772493","https://openalex.org/W2122519207","https://openalex.org/W2122725346","https://openalex.org/W2130350209","https://openalex.org/W2132110147","https://openalex.org/W2133500866","https://openalex.org/W2134859306","https://openalex.org/W2138928022","https://openalex.org/W2150849024","https://openalex.org/W2160348245","https://openalex.org/W2166566585","https://openalex.org/W2171266829","https://openalex.org/W6639581482","https://openalex.org/W6677918625","https://openalex.org/W6678431471"],"related_works":["https://openalex.org/W2033488476","https://openalex.org/W2131092765","https://openalex.org/W2277662012","https://openalex.org/W1589992863","https://openalex.org/W4377015086","https://openalex.org/W1617457131","https://openalex.org/W2369090769","https://openalex.org/W2167268310","https://openalex.org/W1942969496","https://openalex.org/W2134859306"],"abstract_inverted_index":{"We":[0,83],"consider":[1],"the":[2,16,22,33,40,52,55,67,70,73,77,96,124,160,163,196],"problem":[3],"of":[4,24,35,42,54,57,72,98,126,162,195,198],"introducing":[5],"network":[6,10,185],"coding":[7,20,38,101],"in":[8,11,107,152],"a":[9,12,63,108,113,116,153,192,206],"manner":[13],"that":[14,44,88,111,123,144,170,176],"balances":[15],"benefits":[17],"obtained":[18,80,136],"from":[19,81,191],"with":[21,115,131,137],"costs":[23,29],"providing":[25],"coding,":[26,60,127,142],"where":[27],"such":[28],"depend":[30],"both":[31,90],"on":[32,182],"number":[34,56],"nodes":[36,58],"performing":[37,59,141],"and":[39,76,93,184],"volume":[41,71],"traffic":[43,75,151],"is":[45,62,105],"coded.":[46],"Previous":[47],"work":[48],"has":[49],"envisaged":[50],"either":[51],"minimization":[53],"which":[61,128],"NP-hard":[64],"problem,":[65],"or":[66,204],"trade-off":[68],"between":[69],"coded":[74,117,158,186,207],"throughput":[78,164],"gains":[79,125,165],"coding.":[82],"provide":[84],"an":[85,177],"optimization":[86],"framework":[87],"considers":[89,95],"parameters":[91],"jointly":[92],"also":[94],"use":[97],"duplication":[99],"versus":[100],"at":[102],"nodes.":[103],"Traffic":[104],"multicast":[106,118,154,201],"hybrid":[109,179],"way":[110],"combines":[112],"tree":[114],"graph.":[119],"Our":[120],"results":[121,174],"indicate":[122,175],"increase":[129],"markedly":[130],"graph":[132],"density,":[133],"can":[134],"be":[135,157,167],"very":[138],"few":[139],"nodes'":[140],"but":[143],"most,":[145],"though":[146],"by":[147],"no":[148],"means":[149],"all,":[150],"session":[155],"should":[156],"for":[159,169,200,205],"bulk":[161],"to":[166],"achieved":[168],"session.":[171],"Moreover,":[172],"our":[173],"optimized":[178],"approach":[180],"based":[181],"trees":[183,202],"graphs":[187],"may":[188],"differ":[189],"considerably":[190],"mere":[193],"combination":[194],"result":[197],"optimizing":[199],"only":[203],"solution":[208],"alone.":[209]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}