{"id":"https://openalex.org/W4289655502","doi":"https://doi.org/10.1109/isit50566.2022.9834353","title":"Multi-Access Coded Caching Schemes from Maximal Cross Resolvable Designs","display_name":"Multi-Access Coded Caching Schemes from Maximal Cross Resolvable Designs","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655502","doi":"https://doi.org/10.1109/isit50566.2022.9834353"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834353","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/A5034332132","display_name":"Niladri Das","orcid":"https://orcid.org/0000-0002-8257-4483"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Niladri Das","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015398340","display_name":"B. Sundar Rajan","orcid":"https://orcid.org/0000-0002-7847-0200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. Sundar Rajan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034332132"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7278,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84524472,"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":"1719","last_page":"1724"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9947999715805054,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9477999806404114,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8449435234069824},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.8300702571868896},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7080422639846802},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.6331380605697632},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5900301337242126},{"id":"https://openalex.org/keywords/page-cache","display_name":"Page cache","score":0.49860572814941406},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.4954131841659546},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.47582128643989563},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.4738762080669403},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.4290672242641449},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4161057770252228},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3742348849773407},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31448012590408325}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8449435234069824},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8300702571868896},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7080422639846802},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.6331380605697632},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5900301337242126},{"id":"https://openalex.org/C36340418","wikidata":"https://www.wikidata.org/wiki/Q7124288","display_name":"Page cache","level":5,"score":0.49860572814941406},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.4954131841659546},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.47582128643989563},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.4738762080669403},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.4290672242641449},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4161057770252228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3742348849773407},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31448012590408325}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834353","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":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1972738071","https://openalex.org/W1990395546","https://openalex.org/W2106248279","https://openalex.org/W2169897889","https://openalex.org/W2517585112","https://openalex.org/W2793858273","https://openalex.org/W2963358620","https://openalex.org/W2971499952","https://openalex.org/W3005909811","https://openalex.org/W3098870865","https://openalex.org/W3121479791","https://openalex.org/W3175692609","https://openalex.org/W3176225699","https://openalex.org/W3197827353","https://openalex.org/W3204458037","https://openalex.org/W3207674621","https://openalex.org/W3215527597","https://openalex.org/W3216455350","https://openalex.org/W3216851229","https://openalex.org/W4287669071","https://openalex.org/W4289655502","https://openalex.org/W6782504276"],"related_works":["https://openalex.org/W2098406302","https://openalex.org/W2121191383","https://openalex.org/W2009566782","https://openalex.org/W3216288082","https://openalex.org/W2976775806","https://openalex.org/W2116334158","https://openalex.org/W2103666812","https://openalex.org/W2524492834","https://openalex.org/W2147511796","https://openalex.org/W2293321997"],"abstract_inverted_index":{"We":[0,140],"study":[1],"the":[2,27,39,54,62,72,75,100,114,126],"problem":[3,66,94],"of":[4,21,26,33,38,144,180],"multi-access":[5],"coded":[6],"caching":[7],"(MACC):":[8],"a":[9,78,86,103,110,136,142,151,156,160,170,187],"central":[10],"server":[11],"has":[12,67,95],"N":[13,28,40],"files,":[14,29,41],"K":[15,30],"(K":[16],"\u2264":[17],"N)":[18],"caches":[19,108],"each":[20,32,43],"which":[22,34],"stores":[23],"M":[24],"out":[25,37],"users":[31],"demands":[35],"one":[36,82,89],"and":[42,57,177],"user":[44,79,87,104],"accesses":[45,80,88,105],"z":[46,106],"caches.":[47],"The":[48,175],"objective":[49],"is":[50,119,184],"to":[51,60],"jointly":[52],"design":[53],"placement,":[55],"delivery,":[56],"user-to-cache":[58,122,129,138,152,173],"association,":[59,153],"optimize":[61],"achievable":[63],"rate.":[64],"This":[65],"been":[68,96],"extensively":[69],"studied":[70,97],"in":[71],"literature":[73],"under":[74,99],"assumption":[76,101],"that":[77,102],"only":[81,98],"cache.":[83],"However,":[84],"when":[85,148],"or":[90,159],"more":[91],"caches,":[92],"this":[93],"consecutive":[107],"with":[109],"cyclic":[111,127,171],"wrap-around":[112,128,172],"over":[113],"boundaries.":[115],"A":[116,131],"natural":[117],"question":[118],"how":[120],"other":[121,165],"associations":[123],"fare":[124],"against":[125],"association.":[130,139,174],"bipartite":[132,145],"graph":[133],"can":[134],"describe":[135],"general":[137],"identify":[141],"class":[143],"graphs":[146],"that,":[147],"used":[149],"as":[150],"achieves":[154],"either":[155],"lesser":[157,161],"rate":[158],"subpacketization":[162],"than":[163],"all":[164],"existing":[166],"MACC":[167,182],"schemes":[168],"using":[169,186],"placement":[176],"delivery":[178],"strategy":[179],"our":[181],"scheme":[183],"constructed":[185],"combinatorial":[188],"structure":[189],"called":[190],"maximal":[191],"cross":[192],"resolvable":[193],"design.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}