{"id":"https://openalex.org/W2010840590","doi":"https://doi.org/10.1109/isit.2014.6874842","title":"Bounding multiple unicasts through index coding and Locally Repairable Codes","display_name":"Bounding multiple unicasts through index coding and Locally Repairable Codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2010840590","doi":"https://doi.org/10.1109/isit.2014.6874842","mag":"2010840590"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874842","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1402.3895","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021188761","display_name":"Karthikeyan Shanmugam","orcid":"https://orcid.org/0009-0008-2879-5868"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthikeyan Shanmugam","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX","Dept. of Electr. &, Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Electr. &, Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014141359","display_name":"Alexandros G. Dimakis","orcid":"https://orcid.org/0000-0002-4244-7033"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandros G. Dimakis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX","Dept. of Electr. &, Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Electr. &, Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.6965,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73891071,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"296","last_page":"300"},"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.9995999932289124,"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.9995999932289124,"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.9919999837875366,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9914000034332275,"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/unicast","display_name":"Unicast","score":0.8457931280136108},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.7996832132339478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6561530232429504},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5287318229675293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49849677085876465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45689770579338074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4453158676624298},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4262770414352417},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4130384922027588},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3933649957180023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39179107546806335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2738233208656311},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1789337396621704},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.17165198922157288},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1651875376701355},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.14989641308784485}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.8457931280136108},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7996832132339478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6561530232429504},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5287318229675293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49849677085876465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45689770579338074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4453158676624298},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4262770414352417},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4130384922027588},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3933649957180023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39179107546806335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2738233208656311},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1789337396621704},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.17165198922157288},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1651875376701355},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.14989641308784485},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit.2014.6874842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874842","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:arXiv.org:1402.3895","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1402.3895","pdf_url":"https://arxiv.org/pdf/1402.3895","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2010840590","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1402.3895.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.761.7607","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.761.7607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1402.3895.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1402.3895","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1402.3895","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1402.3895","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1402.3895","pdf_url":"https://arxiv.org/pdf/1402.3895","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2010840590.pdf","grobid_xml":"https://content.openalex.org/works/W2010840590.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W177399933","https://openalex.org/W1966060873","https://openalex.org/W1973643917","https://openalex.org/W1981824316","https://openalex.org/W1982110988","https://openalex.org/W1984595105","https://openalex.org/W1984804011","https://openalex.org/W1993830711","https://openalex.org/W1995147907","https://openalex.org/W2005943912","https://openalex.org/W2033203181","https://openalex.org/W2040831377","https://openalex.org/W2042349622","https://openalex.org/W2050413942","https://openalex.org/W2050500290","https://openalex.org/W2051337166","https://openalex.org/W2072475112","https://openalex.org/W2116471929","https://openalex.org/W2123051422","https://openalex.org/W2133739890","https://openalex.org/W2139703052","https://openalex.org/W2161866053","https://openalex.org/W2164684058","https://openalex.org/W2171844485","https://openalex.org/W2221354917","https://openalex.org/W2949454584","https://openalex.org/W2949519087","https://openalex.org/W2951724295","https://openalex.org/W2951733103","https://openalex.org/W2962985178","https://openalex.org/W2964029623","https://openalex.org/W4212896000","https://openalex.org/W6606324823"],"related_works":["https://openalex.org/W2964029623","https://openalex.org/W2470734855","https://openalex.org/W2027252033","https://openalex.org/W2133251572","https://openalex.org/W1966169258","https://openalex.org/W2997030534","https://openalex.org/W2562780502","https://openalex.org/W2056125869","https://openalex.org/W2620136928","https://openalex.org/W1512964282","https://openalex.org/W2050402836","https://openalex.org/W1971506714","https://openalex.org/W2120805995","https://openalex.org/W1501708054","https://openalex.org/W2166886691","https://openalex.org/W2135468972","https://openalex.org/W2145438521","https://openalex.org/W2183610564","https://openalex.org/W3012971507","https://openalex.org/W3022907916"],"abstract_inverted_index":{"We":[0,59,87,171],"establish":[1,116],"a":[2,18,38,45,55,67,70,117,136,163,188],"duality":[3,114],"result":[4,111,166],"between":[5],"linear":[6,34,64],"index":[7,35,74,98,169],"coding":[8,75,99,126,186],"and":[9,51,140,160],"Locally":[10,26],"Repairable":[11,27],"Codes":[12,28],"(LRCs).":[13],"Specifically,":[14],"we":[15,23,133,191],"show":[16,60,88],"that":[17,61,89,143,173],"natural":[19],"extension":[20],"of":[21,48,66,104],"LRCs":[22],"call":[24],"Generalized":[25],"(GLCRs)":[29],"are":[30,134],"exactly":[31],"dual":[32,63],"to":[33,72,95,115,145,149,178],"codes.":[36],"In":[37,128],"GLRC,":[39],"every":[40],"node":[41],"is":[42,69,82,93,157,193],"decodable":[43],"from":[44],"specific":[46],"set":[47],"other":[49],"nodes":[50],"these":[52],"sets":[53],"induce":[54],"recoverability":[56,85],"directed":[57,137],"graph.":[58,86],"the":[62,78,90,96,102,122],"subspace":[65],"GLRC":[68,84,91],"solution":[71],"an":[73,179],"instance":[76],"where":[77],"side":[79],"information":[80],"graph":[81,139],"this":[83,113],"rate":[92],"equivalent":[94],"complementary":[97,168],"rate,":[100],"i.e.":[101],"number":[103],"transmissions":[105],"saved":[106],"by":[107],"coding.":[108,170],"Our":[109,153],"second":[110],"uses":[112],"new":[118,154],"upper":[119,155],"bound":[120,156,175],"for":[121,167,182],"multiple":[123,129,183],"unicast":[124,130,184],"network":[125,131,185],"problem.":[127],"coding,":[132],"given":[135],"acyclic":[138],"r":[141,150],"sources":[142],"want":[144],"send":[146],"independent":[147],"messages":[148],"corresponding":[151],"destinations.":[152],"efficiently":[158],"computable":[159],"relies":[161],"on":[162],"strong":[164],"approximation":[165,180],"believe":[172],"our":[174],"could":[176],"lead":[177],"guarantee":[181],"if":[187],"plausible":[189],"connection":[190],"state":[192],"verified.":[194]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-10T00:00:00"}