Multi-access Coded Caching from a New Class of Cross Resolvable Designs
Multi-access coded caching schemes from cross resolvable designs (CRD) have been reported recently \cite{KNRarXiv}. To be able to compare coded caching schemes with different number of users and possibly with different number of caches a new metric called rate-per-user was introduced and it was show...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| 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 Rajan, B. Sundar |
| description | Multi-access coded caching schemes from cross resolvable designs (CRD) have
been reported recently \cite{KNRarXiv}. To be able to compare coded caching
schemes with different number of users and possibly with different number of
caches a new metric called rate-per-user was introduced and it was shown that
under this new metric the schemes from CRDs perform better than the
Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class
of CRDs is presented and it is shown that the multi-access coded caching
schemes derived from these CRDs perform better than the Maddah-Ali-Niesen
scheme in the entire memory regime. Comparison with other known multi-access
coding schemes is also presented. |
| doi_str_mv | 10.48550/arxiv.2102.00400 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2102_00400</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2102_00400</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-477db90fe9d4c9baa8060c714f2b947e143741a86a80548f4b5b41d03c8f6b4e3</originalsourceid><addsrcrecordid>eNotj81KAzEURrNxIdUHcNW8wIw3M3cmmaVErUJVkO6Hm792IG0k0apv71hdfR8cOHAYuxJQo-o6uKb8NR3rRkBTAyDAOVs9fcT3qSJrfSlcJ-cd12R302HLQ057TvzZf3IdacYpcJ3TfF59SfFIJnp-68u0PZQLdhYoFn_5vwu2ub_b6Idq_bJ61DfrinoJFUrpzADBDw7tYIgU9GClwNCYAaUX2EoUpPoZdKgCms6gcNBaFXqDvl2w5Z_2VDK-5WlP-Xv8LRpPRe0PbwlE2w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Multi-access Coded Caching from a New Class of Cross Resolvable Designs</title><source>arXiv.org</source><creator>Muralidhar, Pooja Nayak ; Rajan, B. Sundar</creator><creatorcontrib>Muralidhar, Pooja Nayak ; Rajan, B. Sundar</creatorcontrib><description>Multi-access coded caching schemes from cross resolvable designs (CRD) have
been reported recently \cite{KNRarXiv}. To be able to compare coded caching
schemes with different number of users and possibly with different number of
caches a new metric called rate-per-user was introduced and it was shown that
under this new metric the schemes from CRDs perform better than the
Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class
of CRDs is presented and it is shown that the multi-access coded caching
schemes derived from these CRDs perform better than the Maddah-Ali-Niesen
scheme in the entire memory regime. Comparison with other known multi-access
coding schemes is also presented.</description><identifier>DOI: 10.48550/arxiv.2102.00400</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2021-01</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.00400$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2102.00400$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Muralidhar, Pooja Nayak</creatorcontrib><creatorcontrib>Rajan, B. Sundar</creatorcontrib><title>Multi-access Coded Caching from a New Class of Cross Resolvable Designs</title><description>Multi-access coded caching schemes from cross resolvable designs (CRD) have
been reported recently \cite{KNRarXiv}. To be able to compare coded caching
schemes with different number of users and possibly with different number of
caches a new metric called rate-per-user was introduced and it was shown that
under this new metric the schemes from CRDs perform better than the
Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class
of CRDs is presented and it is shown that the multi-access coded caching
schemes derived from these CRDs perform better than the Maddah-Ali-Niesen
scheme in the entire memory regime. Comparison with other known multi-access
coding schemes is also presented.</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>eNotj81KAzEURrNxIdUHcNW8wIw3M3cmmaVErUJVkO6Hm792IG0k0apv71hdfR8cOHAYuxJQo-o6uKb8NR3rRkBTAyDAOVs9fcT3qSJrfSlcJ-cd12R302HLQ057TvzZf3IdacYpcJ3TfF59SfFIJnp-68u0PZQLdhYoFn_5vwu2ub_b6Idq_bJ61DfrinoJFUrpzADBDw7tYIgU9GClwNCYAaUX2EoUpPoZdKgCms6gcNBaFXqDvl2w5Z_2VDK-5WlP-Xv8LRpPRe0PbwlE2w</recordid><startdate>20210131</startdate><enddate>20210131</enddate><creator>Muralidhar, Pooja Nayak</creator><creator>Rajan, B. Sundar</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210131</creationdate><title>Multi-access Coded Caching from a New Class of Cross Resolvable Designs</title><author>Muralidhar, Pooja Nayak ; Rajan, B. Sundar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-477db90fe9d4c9baa8060c714f2b947e143741a86a80548f4b5b41d03c8f6b4e3</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>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>Rajan, B. Sundar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multi-access Coded Caching from a New Class of Cross Resolvable Designs</atitle><date>2021-01-31</date><risdate>2021</risdate><abstract>Multi-access coded caching schemes from cross resolvable designs (CRD) have
been reported recently \cite{KNRarXiv}. To be able to compare coded caching
schemes with different number of users and possibly with different number of
caches a new metric called rate-per-user was introduced and it was shown that
under this new metric the schemes from CRDs perform better than the
Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class
of CRDs is presented and it is shown that the multi-access coded caching
schemes derived from these CRDs perform better than the Maddah-Ali-Niesen
scheme in the entire memory regime. Comparison with other known multi-access
coding schemes is also presented.</abstract><doi>10.48550/arxiv.2102.00400</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2102.00400 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2102_00400 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Mathematics - Information Theory |
| title | Multi-access Coded Caching from a New Class of 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-06T20%3A23%3A32IST&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=Multi-access%20Coded%20Caching%20from%20a%20New%20Class%20of%20Cross%20Resolvable%20Designs&rft.au=Muralidhar,%20Pooja%20Nayak&rft.date=2021-01-31&rft_id=info:doi/10.48550/arxiv.2102.00400&rft_dat=%3Carxiv_GOX%3E2102_00400%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 |