Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs

Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs

Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate-per-user has been introduced \cite{KNRarXiv}. In...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Muralidhar, Pooja Nayak, Katyal, Digvijay, Rajan, B. Sundar
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Muralidhar, Pooja Nayak
Katyal, Digvijay
Rajan, B. Sundar
description Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate-per-user has been introduced \cite{KNRarXiv}. In this paper we present a generalization of this work resulting in multi-access coded caching schemes with improved rate-per-user.
doi_str_mv 10.48550/arxiv.2102.01372
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2102_01372</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2102_01372</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-5a93816c7adf069d608d034ea3074655f65a5060360ab418928c2eee677dcd63</originalsourceid><addsrcrecordid>eNotz8tOwzAUBFBvWKCWD2CFfyDhxo4fWVbmFakVEmUf3do3baSkrmyI4O8phdVIo9FIh7HbCsraKgX3mL6GuRQViBIqacQ1a9vplOJMgW8-x4-hQO8pZ-5iOFcO_WE47vnWH2iizPsUJ-5SPA_eKMdxxt1I_IHysD_mJbvqccx0858Ltn16fHcvxfr1uXWrdYHaiEJhI22lvcHQg26CBhtA1oQSTK2V6rVCBRqkBtzVlW2E9YKItDHBBy0X7O7v9ULpTmmYMH13v6TuQpI_MBtFpQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs</title><source>arXiv.org</source><creator>Muralidhar, Pooja Nayak ; Katyal, Digvijay ; Rajan, B. Sundar</creator><creatorcontrib>Muralidhar, Pooja Nayak ; Katyal, Digvijay ; Rajan, B. Sundar</creatorcontrib><description>Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate-per-user has been introduced \cite{KNRarXiv}. In this paper we present a generalization of this work resulting in multi-access coded caching schemes with improved rate-per-user.</description><identifier>DOI: 10.48550/arxiv.2102.01372</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2021-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2102.01372$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2102.01372$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Muralidhar, Pooja Nayak</creatorcontrib><creatorcontrib>Katyal, Digvijay</creatorcontrib><creatorcontrib>Rajan, B. Sundar</creatorcontrib><title>Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs</title><description>Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate-per-user has been introduced \cite{KNRarXiv}. In this paper we present a generalization of this work resulting in multi-access coded caching schemes with improved rate-per-user.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz8tOwzAUBFBvWKCWD2CFfyDhxo4fWVbmFakVEmUf3do3baSkrmyI4O8phdVIo9FIh7HbCsraKgX3mL6GuRQViBIqacQ1a9vplOJMgW8-x4-hQO8pZ-5iOFcO_WE47vnWH2iizPsUJ-5SPA_eKMdxxt1I_IHysD_mJbvqccx0858Ltn16fHcvxfr1uXWrdYHaiEJhI22lvcHQg26CBhtA1oQSTK2V6rVCBRqkBtzVlW2E9YKItDHBBy0X7O7v9ULpTmmYMH13v6TuQpI_MBtFpQ</recordid><startdate>20210202</startdate><enddate>20210202</enddate><creator>Muralidhar, Pooja Nayak</creator><creator>Katyal, Digvijay</creator><creator>Rajan, B. Sundar</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210202</creationdate><title>Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs</title><author>Muralidhar, Pooja Nayak ; Katyal, Digvijay ; Rajan, B. Sundar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-5a93816c7adf069d608d034ea3074655f65a5060360ab418928c2eee677dcd63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Muralidhar, Pooja Nayak</creatorcontrib><creatorcontrib>Katyal, Digvijay</creatorcontrib><creatorcontrib>Rajan, B. Sundar</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Muralidhar, Pooja Nayak</au><au>Katyal, Digvijay</au><au>Rajan, B. Sundar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs</atitle><date>2021-02-02</date><risdate>2021</risdate><abstract>Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate-per-user has been introduced \cite{KNRarXiv}. In this paper we present a generalization of this work resulting in multi-access coded caching schemes with improved rate-per-user.</abstract><doi>10.48550/arxiv.2102.01372</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2102.01372
ispartof
issn
language eng
recordid cdi_arxiv_primary_2102_01372
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T19%3A25%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improved%20Multi-access%20Coded%20Caching%20Schemes%20from%20Cross%20Resolvable%20Designs&rft.au=Muralidhar,%20Pooja%20Nayak&rft.date=2021-02-02&rft_id=info:doi/10.48550/arxiv.2102.01372&rft_dat=%3Carxiv_GOX%3E2102_01372%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true