{"id":"https://openalex.org/W1934478726","doi":"https://doi.org/10.1109/isit.2015.7282745","title":"Improved lower bounds for coded caching","display_name":"Improved lower bounds for coded caching","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1934478726","doi":"https://doi.org/10.1109/isit.2015.7282745","mag":"1934478726"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282745","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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 &amp; Computer Eng. Iowa State University, Ames, 50011, USA","Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical &amp; Computer Eng. Iowa State University, Ames, 50011, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA","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 &amp; Computer Eng. Iowa State University, Ames, 50011, USA","Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical &amp; Computer Eng. Iowa State University, Ames, 50011, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA","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":20.6887,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.99414286,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1696","last_page":"1700"},"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.9918000102043152,"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.9492999911308289,"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/computer-science","display_name":"Computer science","score":0.814362645149231},{"id":"https://openalex.org/keywords/content-delivery","display_name":"Content delivery","score":0.640120804309845},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.5982310771942139},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.581099271774292},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.483141154050827},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47306811809539795},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4625481963157654},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45933640003204346},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4257148206233978},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.42285093665122986},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3748226761817932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1133948564529419}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.814362645149231},{"id":"https://openalex.org/C2986847828","wikidata":"https://www.wikidata.org/wiki/Q269415","display_name":"Content delivery","level":2,"score":0.640120804309845},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.5982310771942139},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.581099271774292},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.483141154050827},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47306811809539795},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4625481963157654},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45933640003204346},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4257148206233978},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.42285093665122986},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3748226761817932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1133948564529419},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282745","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1966660858","https://openalex.org/W2106248279","https://openalex.org/W2579320238","https://openalex.org/W2612181944"],"related_works":["https://openalex.org/W2092530219","https://openalex.org/W2388464034","https://openalex.org/W2533125852","https://openalex.org/W2140460949","https://openalex.org/W2105580438","https://openalex.org/W2057435755","https://openalex.org/W2212571888","https://openalex.org/W3121798572","https://openalex.org/W1967387355","https://openalex.org/W2943958348"],"abstract_inverted_index":{"Content":[0],"delivery":[1,62,70],"networks":[2],"often":[3],"employ":[4],"caching":[5,23,102],"to":[6,14],"reduce":[7],"transmission":[8,33,85],"rates":[9,71,86,103],"from":[10,35],"the":[11,15,19,29,36,55,69,84,122,132],"central":[12,37],"server":[13,38],"end":[16],"users.":[17],"Recently,":[18],"technique":[20],"of":[21,52,119,124,134],"coded":[22,32,61,101],"was":[24],"introduced":[25],"whereby":[26],"coding":[27],"in":[28,43,54],"caches":[30,56],"and":[31,57],"signals":[34,63],"are":[39,137],"considered.":[40],"Prior":[41],"results":[42],"this":[44,93,111],"area":[45],"demonstrate":[46,109,131],"that":[47,110,130],"(a)":[48],"carefully":[49],"designing":[50,59],"placement":[51],"content":[53],"(b)":[58],"appropriate":[60],"allow":[64],"for":[65],"a":[66,125],"system":[67],"where":[68],"can":[72,113],"be":[73,115],"significantly":[74],"smaller":[75],"than":[76,104],"conventional":[77],"schemes.":[78],"However,":[79],"matching":[80],"lower":[81,98],"bounds":[82,99,136],"on":[83,100],"have":[87],"not":[88],"yet":[89],"been":[90],"obtained.":[91],"In":[92],"work,":[94],"we":[95],"derive":[96],"tighter":[97],"were":[105],"known":[106],"previously.":[107],"We":[108],"problem":[112],"equivalently":[114],"posed":[116],"as":[117],"one":[118],"optimally":[120],"labeling":[121],"leaves":[123],"directed":[126],"tree.":[127],"Several":[128],"examples":[129],"utility":[133],"our":[135],"presented.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":26},{"year":2015,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
