{"id":"https://openalex.org/W4310902993","doi":"https://doi.org/10.1109/itw54588.2022.9965826","title":"On the Optimality of Coded Caching With Heterogeneous User Profiles","display_name":"On the Optimality of Coded Caching With Heterogeneous User Profiles","publication_year":2022,"publication_date":"2022-11-01","ids":{"openalex":"https://openalex.org/W4310902993","doi":"https://doi.org/10.1109/itw54588.2022.9965826"},"language":"en","primary_location":{"id":"doi:10.1109/itw54588.2022.9965826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw54588.2022.9965826","pdf_url":null,"source":{"id":"https://openalex.org/S4363606450","display_name":"2022 IEEE Information Theory Workshop (ITW)","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 Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-04087737","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)"],"raw_orcid":null,"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)"],"raw_orcid":null,"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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14799447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"166","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","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/T11478","display_name":"Caching and Content Delivery","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/T12238","display_name":"Green IT and Sustainability","score":0.9465000033378601,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9372000098228455,"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.9752929210662842},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8131103515625},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7419936060905457},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6355339288711548},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4630366265773773},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4436119496822357},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4304487109184265},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4291987419128418},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.37575703859329224},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3726534843444824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12281221151351929}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9752929210662842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8131103515625},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7419936060905457},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6355339288711548},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4630366265773773},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4436119496822357},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4304487109184265},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4291987419128418},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37575703859329224},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3726534843444824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12281221151351929},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw54588.2022.9965826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw54588.2022.9965826","pdf_url":null,"source":{"id":"https://openalex.org/S4363606450","display_name":"2022 IEEE Information Theory Workshop (ITW)","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 Information Theory Workshop (ITW)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04087737v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04087737","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"ITW 2022, IEEE Information Theory Workshop, 1-9 November 2022, Mumbai, India, IEEE, Nov 2022, Mumbai, India. pp.166-171, ⟨10.1109/ITW54588.2022.9965826⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04087737v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04087737","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"ITW 2022, IEEE Information Theory Workshop, 1-9 November 2022, Mumbai, India, IEEE, Nov 2022, Mumbai, India. pp.166-171, ⟨10.1109/ITW54588.2022.9965826⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2106248279","https://openalex.org/W2527594325","https://openalex.org/W2765687053","https://openalex.org/W2767375015","https://openalex.org/W2962880523","https://openalex.org/W2963102996","https://openalex.org/W2963358620","https://openalex.org/W2975269635","https://openalex.org/W2975872333","https://openalex.org/W2989806941","https://openalex.org/W3001688473","https://openalex.org/W3005909811","https://openalex.org/W3045554929","https://openalex.org/W3046173172","https://openalex.org/W3100546252","https://openalex.org/W3103610239","https://openalex.org/W3207674621","https://openalex.org/W3215527597","https://openalex.org/W4206392704","https://openalex.org/W4226403788","https://openalex.org/W4286431518","https://openalex.org/W4289821770"],"related_works":["https://openalex.org/W1997156598","https://openalex.org/W2167303720","https://openalex.org/W2133682266","https://openalex.org/W2497617944","https://openalex.org/W1563139915","https://openalex.org/W2109715593","https://openalex.org/W2061075966","https://openalex.org/W3147501184","https://openalex.org/W2268996566","https://openalex.org/W4256652509"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,40,92],"consider":[4],"a":[5,42,85],"coded":[6,65],"caching":[7,95,112],"scenario":[8],"where":[9],"users":[10,30],"have":[11],"heterogeneous":[12],"interests.":[13],"Taking":[14],"into":[15,33],"consideration":[16],"the":[17,28,47,56,64,76,94,103,110],"system":[18],"model":[19],"originally":[20],"proposed":[21,67],"by":[22,68],"Wang":[23,69],"and":[24,70],"Peleato,":[25,71],"for":[26,109],"which":[27],"end-receiving":[29],"are":[31],"divided":[32],"groups":[34],"according":[35],"to":[36,74,97],"their":[37],"file":[38],"preferences,":[39],"develop":[41],"novel":[43],"information-theoretic":[44],"converse":[45,58],"on":[46],"worst-case":[48,78],"communication":[49,79],"load":[50,80],"under":[51,81],"uncoded":[52,82],"cache":[53],"placement.":[54],"Interestingly,":[55],"developed":[57],"bound,":[59],"jointly":[60],"with":[61],"one":[62],"of":[63,89],"schemes":[66],"allows":[72],"us":[73],"characterize":[75],"optimal":[77],"prefetching":[83],"within":[84],"constant":[86],"multiplicative":[87],"gap":[88],"2.":[90],"Although":[91],"restrict":[93],"policy":[96],"be":[98],"uncoded,":[99],"our":[100],"work":[101],"improves":[102],"previously":[104],"known":[105],"order":[106],"optimality":[107],"results":[108],"considered":[111],"problem.":[113]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}