Pith. sign in

REVIEW 4 major objections 3 minor 74 references

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization

T0 review · 4 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read D2D coded caching can keep its optimal rate while splitting files far less finely.

desk verdict Genuinely new type-based D2D caching designs with real subpacketization gains, but the general framework has two fixable yet load-bearing holes: Algorithm 3 is undefined on all-excluded multicast group types, and Definition 8's vector-LCM rules contradict the paper's own Example 14. read the letter →

arxiv 2602.12220 v2 pith:LIXKWTDQ submitted 2026-02-12 cs.IT math.IT

Xiang Zhang , Giuseppe Caire , Mingyue Ji This is my paper · ORCID
classification cs.ITmath.IT MSC 94A1594A05
keywords codedcachingdevice-to-devicenetworkssubpacketizationfinite-lengthanalysisrateoptimalitypackettypesmulticastdeliveryintegerlinearprogram
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to prove that in device-to-device (D2D) coded caching, the optimal communication rate can be achieved with substantially smaller subpacketization than the standard symmetric construction, in contrast to what the shared-link setting would suggest. It introduces a packet-type framework in which users are grouped, subfiles and multicast groups are classified into types, and the design intentionally breaks symmetry by excluding redundant subfile types and by choosing fewer transmitters in each multicast round. The two resulting savings—subfile saving and further-splitting saving—are coordinated through a vector least common multiple operation. The authors construct three families of rate-optimal schemes: an order-wise reduction in the number of users in the large-memory regime, a more-than-half constant-factor reduction when both the user count and the caching parameter are even, and a constant-factor reduction for a broad class of parameters. If true, this establishes a structural distinction: D2D caching, unlike shared-link caching, does not need full symmetric subpacketization to preserve the optimal rate.

What carries the argument

The central object is the packet type: under a grouping of users into groups, every subfile and every multicast group is labelled by a vector that counts how many of its users come from each group. This type vector induces a structure in which redundant subfile types can be dropped and the number of packets per subfile can be made type-dependent. The transmitter-selection rule ties the local further-splitting factor to the number of transmitters in a multicast group, and the vector least common multiple operation merges local factors into a global splitting vector. The whole design is formulated as an integer linear program over user grouping and transmitter selection, with the memory constr

What would settle it

Find a user grouping and transmitter selection that satisfy α_global Δ_i^T = 0 and the local FS rules, but where some non-excluded subfile W_{n,T} is never included in any coded message, or is included in two, while a user outside T demands it; such an instance would falsify the assertion that every ILP-feasible solution is a valid rate-optimal scheme.

Watch

Extended reading notes

Core claim

The paper's central claim is that every feasible solution of its integer linear program—a choice of user grouping and transmitter selection—yields a valid rate-optimal D2D coded caching scheme, and that optimizing these choices can shrink subpacketization below the baseline value t·C(K,t). Concretely, the paper proves that the subpacketization ratio is at most 1/2 when both K and t are even (Theorem 2); that it is at most min{(1/δ)∏_{i=1}^{δ/2}(2i−1), 1}, with Θ(1/K) vanishing behavior in the large-memory regime (Theorem 1); and that it equals 1 − m∏(q−i)!/∏(K−i) < 1 for K = mq with m, q ≥ t+1 (Theorem 3). The optimal rate is preserved because every coded message remains simultaneously usefu

Load-bearing premise

The load-bearing premise is that whenever the integer program says a design is feasible, every remaining piece of every file actually reaches the user who needs it exactly once; the paper's three constructions satisfy this, but the general statement is asserted rather than proven.

Editorial extensions

If this is right

  • The optimal D2D rate N/M − 1 does not force the baseline subpacketization; for even K and t, the subpacketization can be at most half of the baseline.
  • In the large-memory regime with K and the complement of t even, the subpacketization ratio can vanish as Θ(1/K), which would make finite file lengths practical for large D2D networks.
  • The same packet-type framework reproduces the known subpacketization-optimal constructions for t = 2 and t = K − 2, so the framework subsumes those existing designs.
  • The subpacketization reduction applies also when the number of files is smaller than the number of users, since the optimal-rate characterization in that regime uses the same subpacketization structure.
  • Each feasible solution of the integer program gives a concrete recipe for file splitting, cache placement, and multicast delivery, enabling a systematic search for reduced subpacketization.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorially, the vector-LCM coordination suggests a natural testable extension: optimizing user groupings that are not equal, where the memory constraint becomes nontrivial, could yield further subpacketization reductions beyond the three theorem families.
  • Editorially, the Θ(1/K) order-wise result implies that high-memory D2D caching could in principle operate with subpacketization polynomial in K rather than exponential, and this is a concrete target that could be validated by simulation at moderate K.
  • Editorially, a brute-force enumeration of small K values could check whether every feasible ILP solution actually delivers each non-excluded subfile exactly once; if any feasible solution violates this coverage condition, the general ILP claim would need to be refined or restricted.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The paper proposes a packet type (PT) framework for device-to-device (D2D) coded caching that aims to reduce subpacketization while preserving the optimal JCM communication rate. Users are grouped, and subfiles, packets, and multicast groups are classified into types. Asymmetric transmitter selection yields type-dependent further-splitting factors, coordinated by a vector LCM operation into a global FS vector; a subset of subfile types may be excluded. The design is formulated as an ILP in (44). Three theorem families are claimed: order-wise subpacketization reduction in the large-memory regime (Theorem 1), more-than-half reduction for even K,t (Theorem 2), and constant-factor reduction for K=mq (Theorem 3). The explicit counting formulas and examples are checkable, but the general framework has formal gaps in the definition of the vector LCM, the delivery algorithm for all-excluded group types, and the memory-constraint proof.

Significance. If the three constructions are correct, the paper makes a notable contribution: it would be the first systematic D2D coded caching framework to reduce subpacketization below the JCM baseline while retaining the optimal rate, thereby showing a structural difference from the shared-link setting. The explicit subpacketization counts, the concrete examples, and the self-contained nature of the three constructions are strengths. However, the paper's central claim that every feasible ILP solution (44) yields a valid rate-optimal scheme is not established: the general framework misses coverage conditions and contains an internally inconsistent definition of the vector LCM. These issues are local and repairable, but they must be fixed before the framework-level claims can be accepted.

major comments (4)
  1. [§IV-B6, Definition 8] The special 'only nonzero, non-⋆ entry' rule in Definition 8 contradicts the paper's own examples. In Example 6, column 1 of {a1,a2,a3} has a single nonzero non-⋆ entry (1), yet the reported α_LCM entry is 2, not 0. In Example 14 (t=2, Theorem 2), v2 appears only in α2=1 but is kept with α_global(v2)=1; the literal rule would zero it. The same issue affects Theorem 1's v_{r+1}, which appears in only one local row. The zeroing rule appears intended to model deliberate type exclusion, but as written it is not the operation used in any construction. The definition must be corrected or replaced, and exclusion should be specified as a separate design choice.
  2. [§IV-C3, Algorithm 3; ILP (44)] The ILP (44) enforces only the memory constraint; it contains no coverage constraint ensuring that every non-excluded subfile W_{n,T} is delivered to every user k∉T. Algorithm 3 loops over every multicast group type and every S, forming XORs of packets that may not exist. This is not hypothetical: in the Theorem 2 construction with t=2, K≥6 (Section VI-B, Example 14), the group type s1=(3†,0) has involved type v1=(2,0) with α_global(v1)=0, so the XOR in (49) would reference nonexistent packets. The paper never states that such group types must be skipped, nor does it prove that skipping them leaves every non-excluded subfile delivered exactly once. The assertion in §IV-A that 'each feasible solution corresponds to a valid rate-optimal D2D coded caching scheme' is therefore unsupported.
  3. [§V-A, Eqs. (56)–(57)] The type vectors in the Theorem 1 construction are mis-specified. Equation (56) writes v_i = (2m-(r+i)+1, 1^{2(i-1)}, 0^{r-i+1}), but this vector sums to 2m-r+i-1, not t=2m-2r. Similarly (57) sums to 2m-r+i, not t+1. The examples, e.g. Example 10 with (K,t)=(6,4), show that the intended first entry is 2(m-(r+i)+1), i.e., twice the number of full user groups. As written, the general construction of Theorem 1 is unreproducible and the subpacketization count cannot be verified. This is a load-bearing typo in the main proof.
  4. [Appendix A and §IV-C2] The memory-constraint proof is not general. Appendix A assumes an equal grouping q=(q^m) and a type vector v with all m entries distinct and positive. The ILP (44) and the framework allow unequal groupings, and Example 12 uses one; for that example the constraint α_global Δ_i^T=0 is checked by hand, but no general proof is provided that (43) is necessary or sufficient for H(Z_k)≤ML. The statement in §IV-C2 that 'it can be shown' is therefore not backed by the appendix. A general treatment of the memory constraint, or an explicit restriction of the ILP to cases where it is proven, is needed.
minor comments (3)
  1. [§I-B] Typographical error: 'As a result, As a result,' appears twice in the shared-link finite-length review paragraph.
  2. [Notation, §V] The symbol t is overloaded: in Section V-A the paper defines t ∆=K−t, while the theorem statements use t for the aggregate memory KM/N. This makes formulas such as (62) and (65) difficult to parse. Use distinct notation, e.g. \bar{t}, throughout.
  3. [Various] Minor typos: 'shceme' in Definition 1, 'sbufiles' in §IV-B2, 'unifrom' in Definition 3, 'α' in Example 5 line 'After the vector LCM coordination, the global FS factors arα(v1)=0'. A careful proofreading pass is recommended.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: PT constructions are explicit, and the only self-citations are conference versions not used to force the results.

full rationale

I walked the derivation chain of Theorems 1–3 and the PT framework. The subpacketization claims are obtained by explicit construction: user grouping, subfile/multicast group types, transmitter selection, local FS factors via (28), global FS vector via (35), memory verification via (43), and then the direct evaluation F_PT = alpha_global F^T in (45). Each theorem's ratio bound (13), (15), (17) is a combinatorial consequence of the displayed F(v_i) and alpha_global values; there are no fitted constants, no data-driven predictions, and no later quantity that is just an input renamed as a result. The JCM rate and subpacketization are taken from the external JCM result [3] and the optimality result [18]; they are not derived from the paper itself. The two self-citations [1], [2] are conference versions of parts of this work and are not load-bearing: the central constructions are self-contained and do not rely on an imported uniqueness theorem or on an ansatz from those citations. The vLCM zeroing rule in Definition 8 is a design convention that produces subfile exclusion, not a fitted parameter later called a prediction. I did note correctness gaps—for example, Algorithm 3 does not explicitly skip multicast group types whose involved subfile types are all excluded, and the general claim that every feasible ILP solution yields a valid rate-optimal scheme is stated without a full coverage proof. However, these are unproved implications or technical gaps, not circular reductions: they do not make the claimed bounds equal to the inputs by construction. Therefore no significant circularity is present.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

No empirical constants are fitted and no physical entities are postulated. The design variables — grouping and transmitter selection — are openly optimized rather than hidden degrees of freedom. The main unstated structural premise is the coverage condition discussed in the weakest_assumption.

free parameters (1)
  • User grouping q and transmitter selection D_Tx = Examples: q=(2^{K/2}) for Thm 1, q=(K/2,K/2) for Thm 2, q=(q^m) for Thm 3
    These design choices are optimized by the ILP (44) and are the source of all subpacketization savings; they are chosen by hand and are not forced by the JCM baseline or by external data.
assumptions (4)
  • domain assumption Optimality of the JCM rate for D2D caching with uncoded placement and one-shot delivery
    The paper relies on the prior result (Yapar et al. [18]) that R_JCM = (N-M)/M is optimal when N ≥ K under uncoded placement and one-shot delivery; this is invoked in Section II-A and Remark 1.
  • domain assumption Uncoded cache placement and one-shot delivery restriction
    All constructions operate within this model, stated in Section II-A. Removing this restriction could change the rate-subpacketization trade-off.
  • standard math Combinatorial counting identities, e.g., Σ_v F(v) = C(K,t)
    Used in subpacketization ratios in Sections V and VII; these are standard binomial identities and are not separately derived.
  • domain assumption File length divisibility / zero-padding
    The paper assumes subpacketization F divides the file length L; the introduction notes that zero-padding can be used when it does not, but rate optimality is then no longer guaranteed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization." pith.science (2026). https://pith.science/paper/LIXKWTDQ

@misc{pith2026260212220,
  author       = {Pith},
  title        = {Pith review of: Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LIXKWTDQ}},
  note         = {Machine review of arXiv:2602.12220}
}
read the original abstract

Finite-length design is essential for making coded caching practical, as the optimal communication gains of existing schemes often require prohibitively large subpacketization. This paper studies rate-optimal device-to-device (D2D) coded caching with reduced subpacketization. We propose a packet type-based (PT) framework that exploits the geometric structure induced by user grouping. Under this structure, subfiles, packets, and multicast groups are classified into types, allowing the originally symmetric Ji-Caire-Molisch (JCM) design~\cite{ji2016fundamental} to be systematically relaxed without sacrificing the optimal D2D communication rate. The key feature of the PT framework is that subpacketization reduction is achieved through two complementary mechanisms: \emph{subfile saving}, by excluding redundant subfile types, and \emph{further-splitting saving}, by assigning type-dependent further-splitting factors to subfiles through transmitter selection. The type-dependent splitting factors are then coordinated across multicast group types to produce a globally consistent file-splitting structure. Based on this framework, we construct several classes of rate-optimal D2D coded caching schemes that strictly improve upon the JCM subpacketization. The proposed schemes achieve either order-wise reductions in the number of users or constant-factor reductions over broad memory regimes, while preserving the optimal rate. These results reveal a structural distinction between D2D and shared-link coded caching: unlike in the shared-link setting, full symmetric subpacketization is not necessary for rate-optimal D2D caching.

Figures

Figures reproduced from arXiv: 2602.12220 by the authors.

Figure 1
Figure 1. Necessity of further splitting of subfiles into packets. The left figure achieves a rate of [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. Actual subpacketization ratio (solid lines) versus the upper bound (dotted lines) for [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗
Figure 3
Figure 3. Workflow of the PT design framework. the local FS vector αi ∆= [αi(v)]v∈Ii , where αi(v) denotes the local FS factor for subfile type v. 3) Coordination of local FS vectors: The local FS vectors are coordinated through the vLCM operation to generate the global FS vector αglobal ∆= [α global(v)]v∈V, where α global(v) denotes the global FS factor for type-v subfiles and V ∆= ∪ S i=1Ii denotes the set of all possible s… view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Illustration of subfile types. a single group, whereas type-v2 subfiles are cached by 2 users from one group and one from the other. For instance, Wn,{5,6,7} is type-(3, 0) and Wn,{3,4,8} is type-(2, 1). Let F(v) denote the number of type-v sbufiles. Then F(v1) = 2 4 3…
Figure 5
Figure 5. Figure 5: Illustration of subfile and multicast group types. [PITH_FULL_IMAGE:figures/full_fig_p029_5.png]
Figure 6
Figure 6. Figure 6: Delivery in different types of multicast groups. [PITH_FULL_IMAGE:figures/full_fig_p030_6.png]
Figure 7
Figure 7. Figure 7: Subfile and multicast group types for (K,t) = (6, 2). B. Examples Example 10: Consider (K, N, M) = (6, 3, 2) with (t,t) = (4, 2). Let the user assignment be Q1 = {1, 2}, Q2 = {3, 5}, and Q3 = {5, 6} under q = (2, 2, 2). There are V = 2 subfile types and S = 1 multicast…
Figure 8
Figure 8. Figure 8: Subpacketization ratio FPT/FJCM vs. K. TABLE X: FS Table for Case 2. v1 v2 v3 · · · vj vj+1 · · · v K 2 −r−1 v K 2 −r v K 2 −r+1 α1 y − 1 y α2 y y + 1 . . . . . . αj y + j − 2 αj+1 y + j − 2 y + j − 1 . . . . . . α K 2 −r−1 r − 2 r − 1 α K 2 −r r − 1 r αglobal y − 1 y …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

74 extracted references · 5 linked inside Pith

  1. [1]

    A new design framework on D2D coded caching with optimal rate and less subpacketizations,

    X. Zhang, X. T. Yang, and M. Ji, “A new design framework on D2D coded caching with optimal rate and less subpacketizations,” in 2020 IEEE International Symposium on Information Theory (ISIT), 2020, pp. 1699–1704

    2020

  2. [2]

    Finite-length analysis of D2D coded caching via exploiting asymmetry in delivery,

    X. Zhang and M. Ji, “Finite-length analysis of D2D coded caching via exploiting asymmetry in delivery,” in2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC), 2022, pp. 1–5

    2022

  3. [3]

    Fundamental limits of caching in wireless D2D networks,

    M. Ji, G. Caire, and A. F. Molisch, “Fundamental limits of caching in wireless D2D networks,”IEEE Transactions on Information Theory, vol. 62, no. 2, pp. 849–869, Feb 2016. 44

    2016

  4. [4]

    Fundamental limits of caching,

    M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,”Information Theory, IEEE Trans. on, vol. 60, no. 5, pp. 2856–2867, 2014

    2014

  5. [5]

    Coded caching with nonuniform demands,

    U. Niesen and M. A. Maddah-Ali, “Coded caching with nonuniform demands,”IEEE Transactions on Information Theory, vol. 63, no. 2, pp. 1146–1158, Feb 2017

    2017

  6. [6]

    The exact rate-memory tradeoff for caching with uncoded prefetching,

    Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “The exact rate-memory tradeoff for caching with uncoded prefetching,”IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 1281–1296, 2018

    2018

  7. [7]

    On the fundamental limits of caching in combination networks,

    M. Ji, M. F. Wong, A. M. Tulino, J. Llorca, G. Caire, M. Effros, and M. Langberg, “On the fundamental limits of caching in combination networks,” inSignal Processing Advances in Wireless Communications (SPAWC), 2015 IEEE 16th International Workshop on. IEEE, 2015, pp. 695–699

    2015

  8. [8]

    Fundamental limits of caching with secure delivery,

    A. Sengupta, R. Tandon, and T. C. Clancy, “Fundamental limits of caching with secure delivery,”IEEE Transactions on Information Forensics and Security, vol. 10, no. 2, pp. 355–370, Feb 2015

    2015

Show all 74 references
  1. [9]

    Fundamental limits of cache-aided interference management,

    N. Naderializadeh, M. A. Maddah-Ali, and A. S. Avestimehr, “Fundamental limits of cache-aided interference management,”IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 3092–3107, May 2017

    2017

  2. [10]

    Cache-aided interference management using hypercube combinatorial design with reduced subpacketizations and order optimal sum-degrees of freedom,

    X. Zhang, N. Woolsey, and M. Ji, “Cache-aided interference management using hypercube combinatorial design with reduced subpacketizations and order optimal sum-degrees of freedom,”IEEE Transactions on Wireless Communications, vol. 20, no. 8, pp. 4797–4810, 2021

    2021

  3. [11]

    Femtocaching: Wireless content delivery through distributed caching helpers,

    K. Shanmugam, N. Golrezaei, A. G. Dimakis, A. F. Molisch, and G. Caire, “Femtocaching: Wireless content delivery through distributed caching helpers,”IEEE Transactions on Information Theory, vol. 59, no. 12, pp. 8402–8413, Dec 2013

    2013

  4. [12]

    The exact rate-memory tradeoff for caching with uncoded prefetching,

    Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “The exact rate-memory tradeoff for caching with uncoded prefetching,”IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 1281–1296, Feb 2018

    2018

  5. [13]

    Hierarchical coded caching,

    N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. Diggavi, “Hierarchical coded caching,”IEEE Transactions on Information Theory, vol. PP, no. 99, pp. 1–1, 2016

    2016

  6. [14]

    Content delivery via multi-server coded caching in linear networks,

    S. P. Shariatpanahi, S. A. Motahari, and B. H. Khalaj, “Content delivery via multi-server coded caching in linear networks,” in Information Theory Workshop - Fall (ITW), 2015 IEEE, Oct 2015, pp. 267–271

    2015

  7. [15]

    On the fundamental limits of cache-aided multiuser private information retrieval,

    X. Zhang, K. Wan, H. Sun, M. Ji, and G. Caire, “On the fundamental limits of cache-aided multiuser private information retrieval,” IEEE Transactions on Communications, vol. 69, no. 9, pp. 5828–5842, 2021

    2021

  8. [16]

    A fundamental tradeoff between computation and communication in distributed computing,

    S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,”IEEE Transactions on Information Theory, vol. 64, no. 1, pp. 109–128, 2018

    2018

  9. [17]

    Optimal throughput-outage analysis of cache-aided wireless multi-hop d2d networks,

    M.-C. Lee, M. Ji, and A. F. Molisch, “Optimal throughput-outage analysis of cache-aided wireless multi-hop d2d networks,”IEEE Transactions on Communications, vol. 69, no. 4, pp. 2489–2504, 2021

    2021

  10. [18]

    On the optimality of D2D coded caching with uncoded cache placement and one-shot delivery,

    C ¸ . Yapar, K. Wan, R. F. Schaefer, and G. Caire, “On the optimality of D2D coded caching with uncoded cache placement and one-shot delivery,”IEEE Transactions on Communications, vol. 67, no. 12, pp. 8179–8192, 2019

    2019

  11. [19]

    Device-to-Device secure coded caching,

    A. A. Zewail and A. Yener, “Device-to-Device secure coded caching,”IEEE Transactions on Information Forensics and Security, vol. 15, pp. 1513–1524, 2019

    2019

  12. [20]

    Device-to-device coded-caching with distinct cache sizes,

    A. M. Ibrahim, A. A. Zewail, and A. Yener, “Device-to-device coded-caching with distinct cache sizes,”IEEE Transactions on Communications, vol. 68, no. 5, pp. 2748–2762, 2020

    2020

  13. [21]

    Device-to-Device coded caching with distinct cache sizes,

    ——, “Device-to-Device coded caching with distinct cache sizes,”IEEE Transactions on Communications, vol. 68, no. 5, pp. 2748– 2762, 2020

    2020

  14. [22]

    On the fundamental limits of Device-to-Device private caching under uncoded cache placement and user collusion,

    K. Wan, H. Sun, M. Ji, D. Tuninetti, and G. Caire, “On the fundamental limits of Device-to-Device private caching under uncoded cache placement and user collusion,”IEEE Transactions on Information Theory, vol. 68, no. 9, pp. 5701–5729, 2022

    2022

  15. [23]

    Optimal caching policy for D2D assisted cellular networks with different cache size devices,

    N. Abdolkhani, M. Eslami, J. Haghighat, and W. Hamouda, “Optimal caching policy for D2D assisted cellular networks with different cache size devices,”IEEE Access, vol. 10, pp. 99 353–99 360, 2022. 45

    2022

  16. [24]

    Fundamental limits of coded caching in request-robust d2d communication networks,

    W. Wang, Z. Tao, N. Liu, and W. Kang, “Fundamental limits of coded caching in request-robust d2d communication networks,” Entropy, vol. 26, no. 3, p. 250, 2024

    2024

  17. [25]

    Adding transmitters dramatically boosts coded caching gains for finite file sizes,

    E. Lampiris and P. Elia, “Adding transmitters dramatically boosts coded caching gains for finite file sizes,”IEEE Journal on Selected Areas in Communications, vol. 36, no. 6, pp. 1176–1188, 2018

    2018

  18. [26]

    Finite-length analysis of caching-aided coded multicasting,

    K. Shanmugam, M. Ji, A. M. Tulino, J. Llorca, and A. G. Dimakis., “Finite-length analysis of caching-aided coded multicasting,” IEEE Transactions on Information Theory, vol. 62, no. 10, pp. 5524–5537, 2016

    2016

  19. [27]

    On the placement delivery array design for centralized coded caching scheme,

    Q. Yan, M. Cheng, X. Tang, and Q. Chen, “On the placement delivery array design for centralized coded caching scheme,”IEEE Transactions on Information Theory, vol. 63, no. 9, pp. 5821–5833, Sept 2017

    2017

  20. [28]

    A framework of constructing placement delivery arrays for centralized coded caching,

    M. Cheng, J. Wang, X. Zhong, and Q. Wang, “A framework of constructing placement delivery arrays for centralized coded caching,” IEEE Transactions on Information Theory, vol. 67, no. 11, pp. 7121–7131, 2021

    2021

  21. [29]

    Improving placement delivery array coded caching schemes with coded placement,

    Z. Mingming, C. Minquan, W. Jinyu, Z. Xi, and Y . Chen, “Improving placement delivery array coded caching schemes with coded placement,”IEEE Access, vol. 8, pp. 217 456–217 462, 2020

    2020

  22. [30]

    Placement delivery array based on concatenating construction,

    X. Zhong, M. Cheng, and J. Jiang, “Placement delivery array based on concatenating construction,”IEEE Communications Letters, vol. 24, no. 6, pp. 1216–1220, 2020

    2020

  23. [31]

    Placement delivery array design through strong edge coloring of bipartite graphs,

    Q. Yan, X. Tang, Q. Chen, and M. Cheng, “Placement delivery array design through strong edge coloring of bipartite graphs,”IEEE Communications Letters, vol. 22, no. 2, pp. 236–239, 2018

    2018

  24. [32]

    Constructions of coded caching schemes with flexible memory size,

    M. Cheng, J. Jiang, Q. Yan, and X. Tang, “Constructions of coded caching schemes with flexible memory size,”IEEE Transactions on Communications, vol. 67, no. 6, pp. 4166–4176, 2019

    2019

  25. [33]

    Centralized coded caching schemes: A hypergraph theoretical approach,

    C. Shangguan, Y . Zhang, and G. Ge, “Centralized coded caching schemes: A hypergraph theoretical approach,”IEEE Transactions on Information Theory, pp. 1–1, 2018

    2018

  26. [34]

    Coded caching schemes with reduced subpacketization from linear block codes,

    L. Tang and A. Ramamoorthy, “Coded caching schemes with reduced subpacketization from linear block codes,”IEEE Transactions on Information Theory, vol. 64, no. 4, pp. 3099–3120, April 2018

    2018

  27. [35]

    A unified Ruzsa-Szem´ eredi framework for finite-length coded caching,

    K. Shanmugam, A. G. Dimakis, J. Llorca, and A. M. Tulino, “A unified Ruzsa-Szem´ eredi framework for finite-length coded caching,” in2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017, pp. 631–635

    2017

  28. [36]

    Coded caching with linear subpacketization is possible using Ruzsa-Szem´ eredi graphs,

    K. Shanmugam, A. M. Tulino, and A. G. Dimakis, “Coded caching with linear subpacketization is possible using Ruzsa-Szem´ eredi graphs,” in2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 1237–1241

    2017

  29. [37]

    Coded caching via line graphs of bipartite graphs,

    P. Krishnan, “Coded caching via line graphs of bipartite graphs,” in2018 IEEE Information Theory Workshop (ITW), 2018, pp. 1–5

    2018

  30. [38]

    Subexponential and linear subpacketization coded caching via projective geometry,

    H. H. S. Chittoor, P. Krishnan, K. V . S. Sree, and B. Mamillapalli, “Subexponential and linear subpacketization coded caching via projective geometry,”IEEE Transactions on Information Theory, vol. 67, no. 9, pp. 6193–6222, 2021

    2021

  31. [39]

    A multi-antenna coded caching scheme with linear subpacketization,

    M. Salehi, A. Tolli, and S. P. Shariatpanahi, “A multi-antenna coded caching scheme with linear subpacketization,” inICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020, pp. 1–6

    2020

  32. [40]

    Multi-antenna coded caching analysis in finite SNR and finite subpacketization,

    H. Zhao, E. Lampiris, G. Caire, and P. Elia, “Multi-antenna coded caching analysis in finite SNR and finite subpacketization,” inWSA 2021; 25th International ITG Workshop on Smart Antennas, 2021, pp. 1–6

    2021

  33. [41]

    Diagonal multi-antenna coded caching for reduced subpacketization,

    M. Salehi and A. Tolli, “Diagonal multi-antenna coded caching for reduced subpacketization,” inGLOBECOM 2020 - 2020 IEEE Global Communications Conference, 2020, pp. 1–6

    2020

  34. [42]

    Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT,

    E. Lampiris and P. Elia, “Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT,” in2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2019, pp. 1–5

    2019

  35. [43]

    Cache-aided interference management using hypercube combinatorial cache designs,

    X. Zhang, N. Woolsey, and M. Ji, “Cache-aided interference management using hypercube combinatorial cache designs,” inICC 2019-2019 IEEE International Conference on Communications (ICC). IEEE, 2019, pp. 1–6

    2019

  36. [44]

    Multi-antenna interference management for coded caching,

    A. Tolli, S. P. Shariatpanahi, J. Kaleva, and B. H. Khalaj, “Multi-antenna interference management for coded caching,”IEEE Transactions on Wireless Communications, vol. 19, no. 3, pp. 2091–2106, 2020

  37. [45]

    Stochastic coded caching with optimized shared-cache sizes and reduced subpacketization,

    A. Malik, B. Serbetci, and P. Elia, “Stochastic coded caching with optimized shared-cache sizes and reduced subpacketization,” in ICC 2022 - IEEE International Conference on Communications, 2022, pp. 2918–2923. 46

    2022

  38. [46]

    A low-subpacketization high-performance mimo coded caching scheme,

    M. J. Salehi, H. Bakhshzad Mahmoodi, and A. Toelli, “A low-subpacketization high-performance mimo coded caching scheme,” in WSA 2021; 25th International ITG Workshop on Smart Antennas, 2021, pp. 1–6

    2021

  39. [47]

    Low-complexity high-performance cyclic caching for large miso systems,

    M. Salehi, E. Parrinello, S. P. Shariatpanahi, P. Elia, and A. T ¨olli, “Low-complexity high-performance cyclic caching for large miso systems,”arXiv preprint arXiv:2009.12231, 2020

    2009 arXiv

  40. [48]

    Multi-access coded caching scheme with linear sub-packetization using pdas,

    S. Sasi and B. S. Rajan, “Multi-access coded caching scheme with linear sub-packetization using pdas,”IEEE Transactions on Communications, vol. 69, no. 12, pp. 7974–7985, 2021

    2021

  41. [50]

    Fundamental limits of combinatorial multi-access caching,

    F. Brunero and P. Elia, “Fundamental limits of combinatorial multi-access caching,”IEEE Transactions on Information Theory, vol. 69, no. 2, pp. 1037–1056, 2022

    2022

  42. [51]

    Asymptotically optimal coded distributed computing via combinatorial designs,

    M. Cheng, Y . Wu, X. Li, and D. Wu, “Asymptotically optimal coded distributed computing via combinatorial designs,”IEEE/ACM Transactions on Networking, 2024

    2024

  43. [52]

    Coded caching for miso systems with linear subpacketization,

    M. Cheng, R. Tan, J. Wang, Y . Wu, and X. Li, “Coded caching for miso systems with linear subpacketization,” in2024 9th International Conference on Computer and Communication Systems (ICCCS). IEEE, 2024, pp. 593–598

    2024

  44. [53]

    A novel construction of coded caching schemes with polynomial subpacketizations via projective geometry,

    H. Wei, M. Cheng, and K. Leung, “A novel construction of coded caching schemes with polynomial subpacketizations via projective geometry,” in2024 IEEE Information Theory Workshop (ITW). IEEE, 2024, pp. 496–501

    2024

  45. [54]

    Optimal placement delivery arrays fromt-designs with application to hierarchical coded caching,

    B. S. Rajanet al., “Optimal placement delivery arrays fromt-designs with application to hierarchical coded caching,”arXiv preprint arXiv:2402.07188, 2024

    2024 arXiv

  46. [55]

    Hierarchical coded caching with low subpacketization and coding delay using combinatorial t-designs,

    R. U. NT and B. S. Rajan, “Hierarchical coded caching with low subpacketization and coding delay using combinatorial t-designs,” IEEE Internet of Things Journal, 2025

    2025

  47. [56]

    A new construction structure on coded caching with linear subpacketization: Non-half-sum disjoint packing,

    M. Cheng, H. Wei, K. Wan, and G. Caire, “A new construction structure on coded caching with linear subpacketization: Non-half-sum disjoint packing,”arXiv preprint arXiv:2501.11855, 2025

    2025 arXiv

  48. [57]

    Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching,

    E. Parrinello, A. ¨Unsal, and P. Elia, “Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching,”IEEE Transactions on Information Theory, vol. 66, no. 4, pp. 2252–2268, 2019

    2019

  49. [58]

    D2d coded caching from two classes of optimal dpdas using cross resolvable designs,

    R. U. N T and B. S. Rajan, “D2d coded caching from two classes of optimal dpdas using cross resolvable designs,” in2025 IEEE Wireless Communications and Networking Conference (WCNC), 2025, pp. 1–6

    2025

  50. [59]

    Placement delivery array for cache-aided mimo systems,

    Y . Huang, K. Wan, M. Cheng, J. Wang, and G. Caire, “Placement delivery array for cache-aided mimo systems,”arXiv preprint arXiv:2601.10422, 2026

    2026

  51. [60]

    Multi-access coded caching schemes from cross resolvable designs,

    D. Katyal, P. N. Muralidhar, and B. S. Rajan, “Multi-access coded caching schemes from cross resolvable designs,”IEEE Transactions on Communications, vol. 69, no. 5, pp. 2997–3010, 2021

    2021

  52. [61]

    A low-complexity architecture for multi-access coded caching systems with arbitrary user-cache access topology,

    T. Yang, M. Cheng, X. Yi, R. C. Qiu, and G. Caire, “A low-complexity architecture for multi-access coded caching systems with arbitrary user-cache access topology,”arXiv preprint arXiv:2601.10175, 2026

    2026 arXiv

  53. [62]

    Adapt or wait: Quality adaptation for cache-aided channels,

    E. Lampiris and G. Caire, “Adapt or wait: Quality adaptation for cache-aided channels,”IEEE Transactions on Communications, 2024

    2024

  54. [63]

    On the placement delivery array design for coded caching scheme in d2d networks,

    J. Wang, M. Cheng, Q. Yan, and X. Tang, “On the placement delivery array design for coded caching scheme in d2d networks,”arXiv preprint arXiv:1712.06212, 2017

    2017 arXiv

  55. [64]

    Low subpacketization coded caching via projective geometry for broadcast and d2d networks,

    H. H. S. Chittoor and P. Krishnan, “Low subpacketization coded caching via projective geometry for broadcast and d2d networks,” in 2019 IEEE Global Communications Conference (GLOBECOM). IEEE, 2019, pp. 1–6

    2019

  56. [65]

    Placement delivery array design for coded caching scheme in D2D networks,

    J. Wang, M. Cheng, Q. Yan, and X. Tang, “Placement delivery array design for coded caching scheme in D2D networks,”IEEE Transactions on Communications, vol. 67, no. 5, pp. 3388–3395, 2019

    2019

  57. [66]

    New constructions of D2D placement delivery arrays,

    J. Li and Y . Chang, “New constructions of D2D placement delivery arrays,”IEEE Communications Letters, vol. 27, no. 1, pp. 85–89, 2023

    2023

  58. [67]

    Towards finite file packetizations in wireless Device-to-Device caching networks,

    N. Woolsey, R. Chen, and M. Ji, “Towards finite file packetizations in wireless Device-to-Device caching networks,”IEEE Transactions on Communications, pp. 1–1, 2020. 47

    2020

  59. [68]

    Coded caching design for dynamic networks with reduced subpacketizations,

    X. Wu, M. Cheng, L. Chen, and C. Li, “Coded caching design for dynamic networks with reduced subpacketizations,” in2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023, pp. 430–435

    2023

  60. [69]

    Coded caching for d2d multi-access networks with linear subpacketization via vector set,

    J. Wang, M. Cheng, Y . Wu, and P. Wang, “Coded caching for d2d multi-access networks with linear subpacketization via vector set,” IEEE Transactions on Communications, 2025

    2025

  61. [70]

    D2d coded caching from two classes of optimal dpdas using cross resolvable designs,

    R. U. NT and B. S. Rajan, “D2d coded caching from two classes of optimal dpdas using cross resolvable designs,” in2025 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2025, pp. 1–6

    2025

  62. [71]

    Optimal device-to-device placement delivery arrays using combinatorial designs,

    N. Rashid Ummer and B. S. Rajan, “Optimal device-to-device placement delivery arrays using combinatorial designs,”Discrete Mathematics, Algorithms and Applications, 2026

    2026

  63. [72]

    A new combinatorial design of coded distributed computing,

    N. Woolsey, R.-R. Chen, and M. Ji, “A new combinatorial design of coded distributed computing,” in2018 IEEE International Symposium on Information Theory (ISIT), 2018, pp. 726–730

    2018

  64. [73]

    A new combinatorial coded design for heterogeneous distributed computing,

    ——, “A new combinatorial coded design for heterogeneous distributed computing,”IEEE Transactions on Communications, vol. 69, no. 9, pp. 5672–5685, 2021

    2021

  65. [74]

    Resolvable designs for speeding up distributed computing,

    K. Konstantinidis and A. Ramamoorthy, “Resolvable designs for speeding up distributed computing,”IEEE/ACM Transactions on Networking, vol. 28, no. 4, pp. 1657–1670, 2020

    2020

  66. [75]

    A fundamental tradeoff between computation and communication in distributed computing,

    S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,”IEEE Transactions on Information Theory, vol. 64, no. 1, pp. 109–128, 2017

    2017

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.