{"id":"https://openalex.org/W2509110984","doi":"https://doi.org/10.1109/isit.2016.7541713","title":"Further results on lower bounds for coded caching","display_name":"Further results on lower bounds for coded caching","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2509110984","doi":"https://doi.org/10.1109/isit.2016.7541713","mag":"2509110984"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5007591063","display_name":"Hooshang Ghasemi","orcid":"https://orcid.org/0000-0001-5457-1704"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hooshang Ghasemi","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., Iowa State University, Ames, 50011, USA","Dept. of Electrical & Computer Eng., Iowa State University, Ames, IA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., Iowa State University, Ames, 50011, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., Iowa State University, Ames, IA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., Iowa State University, Ames, 50011, USA","Dept. of Electrical & Computer Eng., Iowa State University, Ames, IA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., Iowa State University, Ames, 50011, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., Iowa State University, Ames, IA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0681,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88624587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2319","last_page":"2323"},"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.9879000186920166,"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/T12288","display_name":"Optimization and Search Problems","score":0.9819999933242798,"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/multiplicative-function","display_name":"Multiplicative function","score":0.8775132894515991},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7604122161865234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.58855801820755},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5597474575042725},{"id":"https://openalex.org/keywords/content-distribution","display_name":"Content distribution","score":0.4977114498615265},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.41532373428344727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35272854566574097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32905182242393494},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0777229368686676}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.8775132894515991},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7604122161865234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.58855801820755},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5597474575042725},{"id":"https://openalex.org/C3018752578","wikidata":"https://www.wikidata.org/wiki/Q269415","display_name":"Content distribution","level":2,"score":0.4977114498615265},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.41532373428344727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35272854566574097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32905182242393494},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0777229368686676},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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":6,"referenced_works":["https://openalex.org/W1659056652","https://openalex.org/W1934478726","https://openalex.org/W2106248279","https://openalex.org/W2616718009","https://openalex.org/W2964122203","https://openalex.org/W6640545256"],"related_works":["https://openalex.org/W4318195686","https://openalex.org/W2975999359","https://openalex.org/W3119693376","https://openalex.org/W2796561647","https://openalex.org/W4280497496","https://openalex.org/W4313513739","https://openalex.org/W3182422617","https://openalex.org/W4313557239","https://openalex.org/W2158905189","https://openalex.org/W4319874546"],"abstract_inverted_index":{"Coded":[0],"caching":[1,22,59],"is":[2,123],"a":[3,28,67,71,103],"technique":[4],"that":[5,52,85],"promises":[6],"huge":[7],"rate":[8,35,60,94,113],"savings":[9],"in":[10],"certain":[11,79],"canonical":[12],"content":[13],"distribution":[14],"scenarios":[15],"over":[16],"the":[17,20,33,41,45,57,93,111,124],"Internet.":[18],"In":[19,74],"coded":[21,58],"setting,":[23],"previous":[24],"contributions":[25],"have":[26],"demonstrated":[27,51],"constant":[29],"multiplicative":[30,104,127],"gap":[31,105,128],"between":[32,110],"achievable":[34,112],"and":[36,114],"corresponding":[37],"lower":[38,54,95,116],"bound":[39],"on":[40,56,70,92],"rate,":[42],"independent":[43],"of":[44,82,106],"problem":[46,69],"parameters.":[47],"Our":[48],"prior":[49],"work":[50],"good":[53],"bounds":[55],"can":[61],"be":[62],"obtained":[63],"by":[64],"equivalently":[65],"considering":[66],"combinatorial":[68],"directed":[72],"tree.":[73],"this":[75,122,131],"work,":[76],"we":[77],"study":[78],"structural":[80],"properties":[81],"our":[83,115,119],"algorithm":[84],"allow":[86],"us":[87,100],"to":[88,101],"analytically":[89],"quantify":[90],"improvements":[91],"bound.":[96,117],"This":[97],"analysis":[98],"allows":[99],"obtain":[102],"at":[107],"most":[108],"four":[109],"To":[118],"best":[120,125],"knowledge,":[121],"known":[126,129],"for":[130],"problem.":[132]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}