{"id":"https://openalex.org/W2144744660","doi":"https://doi.org/10.1109/isit.2009.5205601","title":"Design of efficient robust network codes for multicast connections","display_name":"Design of efficient robust network codes for multicast connections","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2144744660","doi":"https://doi.org/10.1109/isit.2009.5205601","mag":"2144744660"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5113575382","display_name":"Graham Booker","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Graham Booker","raw_affiliation_strings":["Texas A and M University, College Station, TX, USA","Texas A&M University - College Station, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University - College Station, USA#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054178465","display_name":"Alex Sprintson","orcid":"https://orcid.org/0000-0002-5768-5800"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Sprintson","raw_affiliation_strings":["Texas A and M University, College Station, TX, USA","Texas A&M University - College Station, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University - College Station, USA#TAB#","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113575382"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.6857,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74327358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":null,"first_page":"991","last_page":"995"},"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9805999994277954,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.925000011920929,"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.8771458864212036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7697854042053223},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.7691032886505127},{"id":"https://openalex.org/keywords/retransmission","display_name":"Retransmission","score":0.7238337993621826},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.617858350276947},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6071591973304749},{"id":"https://openalex.org/keywords/multiple-description-coding","display_name":"Multiple description coding","score":0.5301785469055176},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43639639019966125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3862910568714142}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8771458864212036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7697854042053223},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7691032886505127},{"id":"https://openalex.org/C180611318","wikidata":"https://www.wikidata.org/wiki/Q7316902","display_name":"Retransmission","level":3,"score":0.7238337993621826},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.617858350276947},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6071591973304749},{"id":"https://openalex.org/C135554599","wikidata":"https://www.wikidata.org/wiki/Q3682206","display_name":"Multiple description coding","level":3,"score":0.5301785469055176},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43639639019966125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3862910568714142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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":22,"referenced_works":["https://openalex.org/W108696806","https://openalex.org/W111740604","https://openalex.org/W177399933","https://openalex.org/W1538771458","https://openalex.org/W2043056692","https://openalex.org/W2055060019","https://openalex.org/W2099805730","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2106831077","https://openalex.org/W2107520978","https://openalex.org/W2123562143","https://openalex.org/W2130350209","https://openalex.org/W2133500866","https://openalex.org/W2138928022","https://openalex.org/W2139416652","https://openalex.org/W2143185888","https://openalex.org/W2164647192","https://openalex.org/W2167614100","https://openalex.org/W2216728905","https://openalex.org/W3100125338","https://openalex.org/W4212896000"],"related_works":["https://openalex.org/W2520306302","https://openalex.org/W2154280206","https://openalex.org/W3159885142","https://openalex.org/W2546221581","https://openalex.org/W2347926101","https://openalex.org/W2157629996","https://openalex.org/W2347917471","https://openalex.org/W1567265102","https://openalex.org/W3152040099","https://openalex.org/W1549943908"],"abstract_inverted_index":{"We":[0,56,80,136],"consider":[1,129],"the":[2,32,36,43,46,50,59,85,122,140,155],"problem":[3],"of":[4,42,52,62,118,121,132,148,163],"establishing":[5],"reliable":[6],"multicast":[7],"connections":[8],"across":[9],"a":[10,100,106,111,130,145],"communication":[11],"network.":[12],"Our":[13],"goal":[14],"is":[15],"to":[16,151,157],"provide":[17],"instantaneous":[18,25],"recovery":[19],"from":[20,154],"single":[21],"edge":[22,134],"failures.":[23],"With":[24],"recovery,":[26],"all":[27,89],"destination":[28,158],"nodes":[29],"can":[30,167],"decode":[31],"packets":[33,149],"sent":[34],"by":[35,82],"source":[37,156],"node":[38],"even":[39],"if":[40],"one":[41],"edges":[44,91],"in":[45,87,143],"network":[47,63,90,101,108,174],"fails,":[48],"without":[49],"need":[51,150],"retransmission":[53],"or":[54],"rerouting.":[55],"build":[57],"on":[58,84],"novel":[60],"technique":[61],"coding":[64,102,165],"that":[65,104,138],"offers":[66],"significant":[67],"advantages":[68],"over":[69,110],"standard":[70],"solutions":[71],"such":[72],"as":[73],"disjoint":[74],"path":[75],"routing":[76],"and":[77],"diversity":[78],"coding.":[79],"begin":[81],"focusing":[83],"case":[86,97,131,142],"which":[88,144],"have":[92],"equal":[93],"capacity.":[94],"For":[95],"this":[96],"we":[98,128],"present":[99],"algorithm":[103,115],"constructs":[105],"robust":[107,173],"code":[109],"small":[112,146],"field.":[113],"The":[114],"takes":[116],"advantage":[117],"special":[119,141,160],"properties":[120,162],"Maximum":[123],"Rank":[124],"Distance":[125],"codes.":[126,175],"Second,":[127],"non-uniform":[133],"capacities.":[135],"show":[137],"for":[139,170],"number":[147],"be":[152,168],"transmitted":[153],"nodes,":[159],"combinatorial":[161],"minimum":[164],"networks":[166],"exploited":[169],"constructing":[171],"efficient":[172]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}