4.7 Article

A Generalized Grouping Scheme in Coded Caching

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 67, Issue 5, Pages 3422-3430

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2019.2896960

Keywords

Coded caching scheme; placement delivery array; concatenating construction; rate; packet number

Funding

  1. NSFC [11601096]
  2. Guangxi Higher Institutions Program of Introducing 100 High-Level Overseas Talents, and Research Fund of Guangxi Key Lab of Multi-source Information Mining Security [16-B-01, 18-B-01]
  3. NSERC of Canada [2017-06410]
  4. 2016GXNSF [FA380011, CA380021]
  5. [2018GXNSFAA138152]

Ask authors/readers for more resources

Coded caching, which could significantly reduce the maximum amount of transmission rate during the peak traffic times in wireless network, has been widely studied recently. Apart from the transmission rate, sub-packetization F reflecting the implementation complexity, is also concerned in coded caching. The grouping method proposed by Shanmugam et al. is well-known and widely used to reduce the sub-packetization level of the coded caching problem. In this paper, we propose a concatenating construction method for coded caching schemes, which generalizes the grouping method. Moreover, we demonstrate the advantage of our method in reducing the transmission rate over the grouping method. In particular, some new explicit schemes are obtained from previously known schemes. From one of these schemes, we can derive all the results by Tang and Ramamoorthy as special cases. Furthermore, the analysis and comparison of these new schemes are also performed.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available