{"id":"https://openalex.org/W2807235930","doi":"https://doi.org/10.1109/isit.2018.8437753","title":"Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes","display_name":"Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2807235930","doi":"https://doi.org/10.1109/isit.2018.8437753","mag":"2807235930"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","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/A5038939588","display_name":"Eleftherios Lampiris","orcid":"https://orcid.org/0000-0003-4655-1900"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Eleftherios Lampiris","raw_affiliation_strings":["EURECOM, Biot, 06410, France","EURECOM, Biot, France"],"affiliations":[{"raw_affiliation_string":"EURECOM, Biot, 06410, France","institution_ids":["https://openalex.org/I1902872"]},{"raw_affiliation_string":"EURECOM, Biot, France","institution_ids":["https://openalex.org/I1902872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015066458","display_name":"Petros Elia","orcid":"https://orcid.org/0000-0002-3531-120X"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Petros Elia","raw_affiliation_strings":["EURECOM, Biot, 06410, France","EURECOM, Biot, France"],"affiliations":[{"raw_affiliation_string":"EURECOM, Biot, 06410, France","institution_ids":["https://openalex.org/I1902872"]},{"raw_affiliation_string":"EURECOM, Biot, France","institution_ids":["https://openalex.org/I1902872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038939588"],"corresponding_institution_ids":["https://openalex.org/I1902872"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06918313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1435","last_page":"1439"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","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/T11478","display_name":"Caching and Content Delivery","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9811999797821045,"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.9592000246047974,"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/bottleneck","display_name":"Bottleneck","score":0.7193630337715149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6539932489395142},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6154666543006897},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6013057231903076},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.524635374546051},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5189040303230286},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5062998533248901},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.48560065031051636},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4610016345977783},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44018325209617615},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28248414397239685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23266804218292236}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7193630337715149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6539932489395142},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6154666543006897},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6013057231903076},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.524635374546051},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5189040303230286},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5062998533248901},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.48560065031051636},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4610016345977783},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44018325209617615},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28248414397239685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23266804218292236},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2018.8437753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:fr.eurecom:5579","is_oa":false,"landing_page_url":"http://www.eurecom.fr/publication/5579","pdf_url":null,"source":{"id":"https://openalex.org/S4377196942","display_name":"Graduate School and Research Center in Digital Science (EURECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1902872","host_organization_name":"EURECOM","host_organization_lineage":["https://openalex.org/I1902872"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT 2018, IEEE International Symposium on Information Theory, 17-22 June 2018, Vail, Colorado, USA","raw_type":"Conference"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1555291764","https://openalex.org/W2094087391","https://openalex.org/W2106248279","https://openalex.org/W2236240782","https://openalex.org/W2511490373","https://openalex.org/W2515623395","https://openalex.org/W2517585112","https://openalex.org/W2580681290","https://openalex.org/W2589022566","https://openalex.org/W2591528568","https://openalex.org/W2604497343","https://openalex.org/W2724579330","https://openalex.org/W2740920677","https://openalex.org/W2962757087","https://openalex.org/W2963133970","https://openalex.org/W2963267958","https://openalex.org/W2963345310","https://openalex.org/W2963512711","https://openalex.org/W2963692980","https://openalex.org/W2963720294","https://openalex.org/W2963745869","https://openalex.org/W3103610239","https://openalex.org/W6689458619"],"related_works":["https://openalex.org/W2595172197","https://openalex.org/W2084856301","https://openalex.org/W2127970246","https://openalex.org/W2885125400","https://openalex.org/W1989889224","https://openalex.org/W4382618745","https://openalex.org/W1973775000","https://openalex.org/W2748922771","https://openalex.org/W1987128138","https://openalex.org/W2743976221"],"abstract_inverted_index":{"In":[0,54],"the":[1,7,13,24,33,43,66,71,86,175,182,199,215,244,260,271],"context":[2],"of":[3,28,50,157,179,241,259],"coded":[4,29,184],"caching":[5,30,68,95,104,115,141,177,185],"in":[6,89,119,168],"K-user":[8],"BC,":[9],"our":[10,212],"work":[11,253],"reveals":[12,58],"surprising":[14],"fact":[15],"that":[16,59,93,135],"having":[17],"multiple":[18],"(L)":[19],"transmitting":[20,195],"antennas,":[21],"dramatically":[22],"ameliorates":[23],"longstanding":[25],"subpacketization":[26,35,133,190,200,229,235,273],"bottleneck":[27],"by":[31,46,255],"reducing":[32],"required":[34,272],"to":[36,52,109,131,139,143,204],"approximately":[37],"its":[38],"Lth":[39],"root,":[40],"thus":[41,126],"boosting":[42],"actual":[44],"DoF":[45,219],"a":[47,128,132,239,256],"multiplicative":[48,129],"factor":[49,240],"up":[51,108],"L.":[53],"asymptotic":[55],"terms,":[56],"this":[57,252],"as":[60,62],"long":[61],"L":[63,110,159],"scales":[64],"with":[65,81,228],"theoretical":[67,176,216],"gain,":[69],"then":[70],"full":[72,76],"cumulative":[73,218],"(multiplexing":[74],"+":[75],"caching)":[77],"gains":[78,96,105,116,142,166,249],"are":[79,107],"achieved":[80,103],"constant":[82],"subpacketization.":[83],"This":[84],"is":[85,149,237],"first":[87],"time,":[88],"any":[90,114,120],"known":[91,138,203],"setting,":[92,125],"unbounded":[94],"appear":[97],"under":[98,181],"finite":[99],"file-size":[100],"constraints.":[101],"The":[102,146,164,231,248],"here":[106],"times":[111],"higher":[112],"than":[113],"previously":[117,137,202],"experienced":[118],"single-":[121],"or":[122,206],"multiantenna":[123],"fully-connected":[124],"offering":[127],"mitigation":[130],"problem":[134],"was":[136,201],"hard-bound":[140],"small":[144],"constants.":[145],"proposed":[147],"scheme":[148,213],"practical":[150],"and":[151,160],"it":[152],"works":[153],"for":[154,171,210],"all":[155,161],"values":[156],"K,":[158],"cache":[162],"sizes.":[163],"scheme's":[165,232],"show":[167],"practice:":[169],"e.g.":[170],"K=100,":[172],"when":[173],"L=1":[174],"gain":[178],"G=10,":[180],"original":[183],"algorithm,":[186],"would":[187],"have":[188],"needed":[189],",":[191],"while":[192],"if":[193],"extra":[194],"antennas":[196],"were":[197],"added,":[198],"match":[205],"exceed":[207],"S1.":[208],"Now":[209],"L=5,":[211],"offers":[214],"(unconstrained)":[217],"dI":[220],"=":[221,223,226],"L+G":[222],"5":[224],"+10":[225],"15,":[227],"SL=\\binomK/LG/L=\\binom100/510/5=190.":[230],"performance,":[233],"given,":[234],"sL=\\binomK/LG/L,":[236],"within":[238],"2":[242],"from":[243,251],"optimal":[245],"linear":[246],"sum-DoF.":[247],"stemming":[250],"come":[254],"virtual":[257],"decomposition":[258],"fully":[261],"connected":[262],"cache-aided":[263],"channel":[264],"into":[265],"parallel":[266],"ones,":[267],"which":[268],"significantly":[269],"reduces":[270]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}