{"id":"https://openalex.org/W4289713090","doi":"https://doi.org/10.1109/isit50566.2022.9834536","title":"The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology","display_name":"The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713090","doi":"https://doi.org/10.1109/isit50566.2022.9834536"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834536","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-04095017","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015393007","display_name":"Federico Brunero","orcid":"https://orcid.org/0000-0002-6980-3827"},"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":"Federico Brunero","raw_affiliation_strings":["EURECOM,Communication Systems Department,Sophia Antipolis,France","Eurecom [Sophia Antipolis] (Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex - France)"],"affiliations":[{"raw_affiliation_string":"EURECOM,Communication Systems Department,Sophia Antipolis,France","institution_ids":["https://openalex.org/I1902872"]},{"raw_affiliation_string":"Eurecom [Sophia Antipolis] (Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex - 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,Communication Systems Department,Sophia Antipolis,France","Eurecom [Sophia Antipolis] (Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex - France)"],"affiliations":[{"raw_affiliation_string":"EURECOM,Communication Systems Department,Sophia Antipolis,France","institution_ids":["https://openalex.org/I1902872"]},{"raw_affiliation_string":"Eurecom [Sophia Antipolis] (Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex - France)","institution_ids":["https://openalex.org/I1902872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015393007"],"corresponding_institution_ids":["https://openalex.org/I1902872"],"apc_list":null,"apc_paid":null,"fwci":1.5074,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81380551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1701","last_page":"1706"},"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.992900013923645,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9894999861717224,"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/converse","display_name":"Converse","score":0.8879378437995911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7455308437347412},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6360138654708862},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.6139745712280273},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5603457093238831},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5299060344696045},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4585146903991699},{"id":"https://openalex.org/keywords/access-time","display_name":"Access time","score":0.4437849819660187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43234938383102417},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3827933073043823},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3659024238586426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24304860830307007}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8879378437995911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7455308437347412},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6360138654708862},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.6139745712280273},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5603457093238831},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5299060344696045},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4585146903991699},{"id":"https://openalex.org/C194080101","wikidata":"https://www.wikidata.org/wiki/Q46306","display_name":"Access time","level":2,"score":0.4437849819660187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43234938383102417},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3827933073043823},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3659024238586426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24304860830307007},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit50566.2022.9834536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834536","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04095017v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04095017","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ISIT 2022, IEEE International Symposium on Information Theory, Jun 2022, Espoo, Finland. pp.1701-1706, ⟨10.1109/ISIT50566.2022.9834536⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04095017v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04095017","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ISIT 2022, IEEE International Symposium on Information Theory, Jun 2022, Espoo, Finland. pp.1701-1706, ⟨10.1109/ISIT50566.2022.9834536⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1544602402","https://openalex.org/W1981824316","https://openalex.org/W2106248279","https://openalex.org/W2130507035","https://openalex.org/W2765687053","https://openalex.org/W2767375015","https://openalex.org/W2963358620","https://openalex.org/W2971499952","https://openalex.org/W2989806941","https://openalex.org/W3001688473","https://openalex.org/W3005909811","https://openalex.org/W3048689525","https://openalex.org/W3094622999","https://openalex.org/W3100546252","https://openalex.org/W3121479791","https://openalex.org/W3160984973","https://openalex.org/W3197944919","https://openalex.org/W3201493127","https://openalex.org/W3212945524","https://openalex.org/W3215527597","https://openalex.org/W3215757237","https://openalex.org/W4206392704","https://openalex.org/W4226167999","https://openalex.org/W4286904252","https://openalex.org/W4394656034","https://openalex.org/W6755647483","https://openalex.org/W6797312417","https://openalex.org/W6801657900","https://openalex.org/W6803158576","https://openalex.org/W6811363305"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2043159103","https://openalex.org/W2391769344","https://openalex.org/W4297790016","https://openalex.org/W2359260952","https://openalex.org/W2769269860","https://openalex.org/W2388752733","https://openalex.org/W3109562497"],"abstract_inverted_index":{"Recently,":[0],"Muralidhar":[1,82],"et":[2,83],"al.":[3],"proposed":[4,37],"a":[5,19],"novel":[6],"multi-access":[7,32,65],"system":[8],"model":[9],"where":[10],"each":[11],"user":[12],"is":[13],"connected":[14],"to":[15],"multiple":[16],"caches":[17],"in":[18],"manner":[20],"that":[21],"follows":[22],"the":[23,34,45,60,78,85],"well-known":[24],"combinatorial":[25],"topology":[26],"of":[27,63],"combination":[28],"networks.":[29],"For":[30],"such":[31,64],"topology,":[33],"same":[35],"authors":[36],"an":[38,71],"achievable":[39],"scheme,":[40],"which":[41,74],"stands":[42],"out":[43],"for":[44],"unprecedented":[46],"coding":[47],"gains":[48],"even":[49],"with":[50,67,77],"very":[51],"modest":[52],"cache":[53],"resources.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"identify":[59],"fundamental":[61],"limits":[62],"setting":[66],"exceptional":[68],"potential,":[69],"providing":[70],"information-theoretic":[72],"converse":[73],"establishes,":[75],"together":[76],"inner":[79],"bound":[80],"by":[81],"al.,":[84],"exact":[86],"optimal":[87],"performance":[88],"under":[89],"uncoded":[90],"prefetching.":[91]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}