{"id":"https://openalex.org/W4289655222","doi":"https://doi.org/10.1109/isit50566.2022.9834745","title":"An Improved Lower Bound for Multi-Access Coded Caching","display_name":"An Improved Lower Bound for Multi-Access Coded Caching","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655222","doi":"https://doi.org/10.1109/isit50566.2022.9834745"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834745","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834745","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030167148","display_name":"K. K. Krishnan Namboodiri","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"K. K. Krishnan Namboodiri","raw_affiliation_strings":["Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru","Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015398340","display_name":"B. Sundar Rajan","orcid":"https://orcid.org/0000-0002-7847-0200"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. Sundar Rajan","raw_affiliation_strings":["Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru","Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030167148"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.4324,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46370968,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1713","last_page":"1718"},"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.9848999977111816,"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.9739999771118164,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7584044933319092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.679373562335968},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6485630869865417},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6275623440742493},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42899036407470703},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.258233904838562}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7584044933319092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.679373562335968},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6485630869865417},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6275623440742493},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42899036407470703},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.258233904838562},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834745","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834745","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1555291764","https://openalex.org/W1659056652","https://openalex.org/W2035732803","https://openalex.org/W2106248279","https://openalex.org/W2261398996","https://openalex.org/W2589792074","https://openalex.org/W2616718009","https://openalex.org/W2963358620","https://openalex.org/W2971499952","https://openalex.org/W3005909811","https://openalex.org/W3105115639","https://openalex.org/W3161659930","https://openalex.org/W3175692609","https://openalex.org/W3176225699","https://openalex.org/W3176695937","https://openalex.org/W3197944919","https://openalex.org/W3198594719","https://openalex.org/W3215757237","https://openalex.org/W4285270382","https://openalex.org/W4287669071","https://openalex.org/W6692087600","https://openalex.org/W6782504276","https://openalex.org/W6797312417","https://openalex.org/W6797735708","https://openalex.org/W6843368072"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"The":[0,70],"multi-access":[1,44],"variant":[2],"of":[3,42,61],"the":[4,38,43,57,62,77,83],"coded":[5,45],"caching":[6,46],"problem":[7],"with":[8],"N":[9],"files,":[10],"K":[11,14],"users":[12],"and":[13],"caches,":[15],"where":[16],"each":[17],"user":[18],"has":[19],"access":[20],"to":[21],"L":[22],"neighbouring":[23],"caches":[24],"in":[25],"a":[26],"cyclic":[27],"wrap-around":[28],"manner,":[29],"is":[30,49,65,74],"considered.":[31],"A":[32],"cut-set":[33],"based":[34],"lower":[35,54,72,80],"bound":[36,55,73],"on":[37,56],"optimal":[39,58],"rate-memory":[40,59],"trade-off":[41,60],"(MACC)":[47],"scheme":[48,64],"derived.":[50],"Furthermore,":[51],"an":[52],"improved":[53,71],"MACC":[63],"derived":[66],"using":[67],"non-cut-set":[68],"arguments.":[69],"tighter":[75],"than":[76],"previously":[78],"known":[79],"bounds":[81],"for":[82],"same":[84],"setting.":[85]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}