Improving Placement Delivery Array Coded Caching Schemes With Coded Placement

Zhang, Mingming; Cheng, Minquan; Wang, Jinyu; Zhong, Xi; Chen, Yishan

doi:10.1109/access.2020.3042849

Cited by 10 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The hybrid scheme obtained by a hybrid construction of CPDA works for the arbitrary parameter u as well as has significant advantages in subpacketization compared with the ZY scheme. In addition, the direct scheme and the hybrid scheme have significant advantages in transmission load for each relay compared with the naive scheme, which is obtained by repeatedly using the scheme in [19] u times. Moreover, the subpacketization of the direct scheme is lower than that of the naive scheme.…”

Section: Discussionmentioning

confidence: 99%

“…In a PDA, a star not contained in any subarray shown as (1) in C3-b of Definition 1 is called useless. The authors in [19] pointed out that useless stars not only make no contribution to reducing the transmission load but also result in high subpacketization. If each column of a (K, F, Z, S) PDA has Z useless stars, the authors in [19] improved the scheme in [16] by deleting all the useless stars and using an [F, F − Z ] q maximum distance separable (MDS) code [20] for some prime power q, and came up with a new coded caching scheme with a smaller transmission load and subpacketization than the original scheme in [16] for the same number of users and memory ratio.…”

Section: Combinatorial Placement Delivery Arraymentioning

confidence: 99%

“…In this section, we compare the direct scheme in Theorem 1 and the hybrid scheme in Theorem 3 with the ZY scheme in Lemma 4 and the naive scheme of repeatedly using the scheme in [19] (referred to as the naive scheme).…”

Section: Performance Analysismentioning

confidence: 99%

See 2 more Smart Citations

Coded Caching for Combination Networks with Multiaccess

et al. 2022

Self Cite

View full text Add to dashboard Cite

In a traditional (H,r) combination network, each user connects to a unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess combination network problem wherein each unique set of r relays is connected by u users. In this paper, we focus on designing coded caching schemes for a (H,r,u) multiaccess combination network. By directly applying the well-known coding method (proposed by Zewail and Yener) for a (H,r) combination network, a coded caching scheme (called ZY scheme) for (H,r,u) multiaccess combination network is obtained. However, its subpacketization has an exponential order with the number of users which leads to high implementation complexity. In order to reduce subpacketization, a direct construction of a coded caching scheme (called the direct scheme) for (H,r,u) multiaccess combination network is proposed by means of combinational design theory, where the parameter u must be a combinatorial number. For the arbitrary parameter u, the hybrid construction of a coded caching scheme (called the hybrid scheme) for the (H,r,u) multiaccess combination network is proposed based on the direct scheme. Theoretical and numerical analysis shows that the direct scheme and the hybrid scheme have a smaller transmission load for each relay compared with the naive scheme (which is obtained by repeatedly applying the coded caching scheme for a traditional (H,r) combination network by u times) and have much lower subpacketization compared with the ZY scheme.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Combinatorial Placement Delivery Arraymentioning

confidence: 99%

See 1 more Smart Citation

Coded Caching for Combination Networks with Multiaccess

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…In regular PDA, each integer occurs the same number of times. Various coded caching schemes based on the design of PDA were proposed recently [12] - [17]. Also, there exists several other constructions that focus on reducing sub-packetization, some of which uses resolvable block design and linear block codes [18], the strong edge colouring of subset graphs [19], projective space [20] etc.…”

Section: A Related Workmentioning

confidence: 99%

Coded Caching with Shared Caches from Generalized Placement Delivery Arrays

Peter¹,

Rajan²

2021

Preprint

View full text Add to dashboard Cite

We consider the coded caching problem with shared caches where several users share a cache, but each user has access to only a single cache. For this network, the fundamental limits of coded caching are known for centralized and decentralized settings under uncoded placement. In the centralized case, to achieve the gains offered by coded caching, one requires a subpacketization which increases exponentially with the number of caches. The dedicated cache networks had a similar issue, and placement delivery arrays (PDAs) were introduced as a solution to it. Using the PDA framework, we propose a procedure to obtain new coded caching schemes for shared caches with lower sub-packetization requirements. The advantage of this procedure is that we can transform all the existing PDA structures into coded caching schemes for shared caches, thus resulting in low sub-packetization schemes. We also show that the optimal scheme given by Parrinello, Ünsal and Elia (Fundamental Limits of Coded Caching with Multiple Antennas, Shared Caches and Uncoded Prefetching) can be recovered using a Maddah-Ali Niesen PDA.

show abstract