Fundamental Limits of Wireless Caching under Uneven-Capacity Channels

Eleftherios Lampiris; Jingjing Zhang; Osvaldo Simeone; Petros Elia

REVIEW 2 major objections 5 minor 36 references

Fundamental Limits of Wireless Caching under Uneven-Capacity Channels

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read A superposition-coding scheme achieves the optimal worst-case delivery time of cache-aided multicasting within a factor of 4 when receiver channel capacities are uneven.

desk verdict Factor-4 order-optimal result for uneven-capacity coded caching is correct in substance, but Algorithm 1 has an off-by-one that omits the final layer and must be fixed. read the letter →

arxiv 1908.04036 v2 pith:PMFCCGAR submitted 2019-08-12 cs.IT math.IT

Eleftherios Lampiris , Jingjing Zhang , Osvaldo Simeone , Petros Elia This is my paper · ORCID

classification cs.ITmath.IT MSC 94A1594A05

keywords codedcachingwirelessbroadcastchannelsuperpositioncodingworst-userbottleneckunevencapacitiesdeliverytimemulticastgain

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 asks whether the multicast gains of coded caching survive when receivers have unequal channel capacities. It answers yes: a superposition-coding scheme delivers all requested files within a factor of 4 of the optimal worst-case delivery time for any number of users, any cache fraction, and any capacity vector. The scheme's key move is to identify a bottleneck user that need not be the weakest user, then transmit XOR messages assigned to each power layer at the rate of that layer's weakest participant while stronger messages ride in higher layers. A corollary shows that the ideal all-unit-capacity delay remains achievable even when many users have degraded channels, provided each user $k$'s capacity stays above about $1-e^{-k\gamma}$. The result matters because the worst-user bottleneck was thought to halve or worse the coded-caching gain; this paper argues the gain can be preserved up to a constant factor.

What carries the argument

The load-bearing object is the superposition-coding layer structure built from the XOR multicast messages of the standard placement scheme. Each message $X_\sigma$ is assigned to power layer $k$ if the weakest user in $\sigma$ is user $k$; layer $k$ then contains $\binom{K-k}{K\gamma}$ messages. The algorithm picks a bottleneck user $w$ maximizing $\left(\binom{K}{K\gamma+1}-\binom{K-w}{K\gamma+1}\right)/\alpha_w$, sets every layer's rate proportional to $\alpha_w$, and allocates powers $P^{-\beta_k}$ so that each user decodes its own higher layers by successive interference cancellation while treating lower layers as noise. This reduces the uneven-capacity problem to a single scalar bottleneck parameter $w$ and yields the closed-form delay. The converse hinges on a cut lower bound for a $w$-user cache network applied to the augmented system.

What would settle it

Run the proposed scheme and a brute-force-optimal schedule on a small instance such as $K=4$, $\gamma=1/4$, $\alpha=(\epsilon,1,1,1)$; if the optimal worst-case delivery time falls below $T_{\mathrm{sc}}/4$, the factor-4 gap claim is false, and if the augmented-system lower bound is violated, the converse step is unsound.

Watch

Extended reading notes

Core claim

On its own terms, the paper's discovery is a tight constant-factor characterization of the optimal worst-case delivery time in the $K$-user SISO broadcast channel with cache fraction $\gamma$ and ordered capacities $\alpha_1 \leq \cdots \leq \alpha_K$. Theorem 1 states that the delay $T_{\mathrm{sc}} = \max_w \left\{ \frac{1}{\alpha_w} \cdot \frac{\binom{K}{K\gamma+1} - \binom{K-w}{K\gamma+1}}{\binom{K}{K\gamma}} \right\}$ is achievable and lies within a factor of 4 of the optimum $T^*$. The achievability scheme partitions the $\binom{K}{K\gamma+1}$ multicast XOR messages into layers according to their weakest user and superposes them, with power and rate chosen so that each user decodes its own layers and treats lower layers as noise. The converse augments the system by raising the first $w$ users' capacities to $\alpha_w$ and the rest to 1, then applies a known factor-2 lower bound for $w$-user cache networks to conclude no scheme can do much better. A direct corollary is that the baseline delay $K(1-\gamma)/(1+K\gamma)$ is preserved when $\alpha_k \geq 1 - \binom{K-k}{K\gamma+1}/\binom{K}{K\gamma+1} \approx 1-e^{-k\gamma}$ for every $k$.

Load-bearing premise

The converse assumes that adding extra stronger users with caches cannot reduce the time needed to serve the weak users below the known lower bound for a $w$-user system.

Editorial extensions

If this is right

If Theorem 1 is right, uneven channel capacities cost at most a constant factor of 4, so cache-aided multicast remains usable in wireless broadcast settings with heterogeneous links.
The threshold $\alpha_k \gtrsim 1-e^{-k\gamma}$ means the full unit-capacity delay is achievable even when many users have weaker channels, and smaller caches make the system more tolerant of unevenness.
The bottleneck user $w$ defined by the argmax, not the weakest user, governs delivery time, so channel improvements should be targeted at users near $w$.
Because the scheme reuses the baseline cache placement unchanged, it can be layered onto existing coded-caching deployments without changing the prefetching phase.

Reading between the lines

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

A sharp experimental check would measure the delay onset against the predicted threshold $1-e^{-k\gamma}$ in a small three- or four-user testbed; the formula is precise enough to accept or reject.
The converse's cut lower bound is the most likely place for improvement; if stronger users' caches can help weaker users decode, the true multiplicative gap may be below 4, and exact small-$K$ computations could reveal it.
The same layer-superposition idea could be ported to multi-antenna or erasure broadcast channels, where each user's 'capacity' becomes a decoding probability rather than a fixed rate and the bottleneck user becomes a random index.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Two things to know. First, the main theorem is right: a factor-4 order-optimal worst-case delivery time for cache-aided SISO BC with uneven capacities, via a superposition scheme that transmits XORs in layers indexed by the weakest user in each subset. Second, the paper as written has a concrete off-by-one: Algorithm 1 runs power layers only up to K−Kγ−1, but XORs exist up to min-user index K−Kγ. The final layer is a single XOR X_{K−Kγ,...,K}, and without it those users do not get all their data. The achievability proof of Theorem 1 therefore fails as stated. It is a one-line fix: extend the loop and the β recursion to K−Kγ; the per-layer delay is unchanged by the same cancellation that makes all other layers equal. I checked the algebra in Eqs. (24)-(25) and the gap proof in Section V; both are consistent once that layer is included.

What is genuinely new: the previous topological result [14] handled a binary case; this generalizes to arbitrary K and capacity levels, and the factor-4 converse is new. The threshold corollary (full-capacity delay achievable if α_k ≥ 1−e^{−kγ}) is a nice by-product and follows from the theorem plus Stirling, no curve fitting.

Soft spots, in order of seriousness. (1) The off-by-one above. It is real, but it is exactly the kind of bug that survives a first submission and gets fixed in revision; the conceptual scheme stands. (2) The converse uses the factor-2 lower bound of [36] on a w-user network, applied to an augmented K-user system where the first w users have capacity α_w and the rest unit. The paper handwaves the cut argument. On reading, the missing step is a standard subset argument: ignore the extra K−w users and treat the first w as a standalone w-user network with rate α_w; their caches give no additional leverage, so the [36] bound applies. That should be written down, but I do not believe it collapses. (3) Minor: the threshold is presented with the approximation sign; the exact binomial expression is what is proved, and the exponential is asymptotic. That is fine, but it should be labeled.

The citation pattern is fair; self-citations are to prior work by the same group on the topological case, which is the actual starting point, so no concern.

Who is this for: people working on coded caching for wireless broadcast. Not a broad-field paper, but it settles a natural open question within a constant factor. I would send it to a serious referee. If I were the editor, I'd ask for a revision that fixes Algorithm 1 and spells out the subset argument.

Referee Report

2 major / 5 minor

Summary. The paper studies a K-user cache-aided SISO broadcast channel in which the receivers have generally different normalized capacities alpha_k, ordered from weakest to strongest. It proposes a superposition-coding delivery scheme that transmits coded-caching XOR messages in power layers indexed by the weakest user in the message's user subset. The main result, Theorem 1, claims that the worst-case delivery time T_sc(K,gamma,alpha) = max_w (1/alpha_w) [C(K,Kgamma+1)-C(K-w,Kgamma+1)]/C(K,Kgamma) is achievable and is within a multiplicative factor of 4 of the optimal delivery time. A corollary gives per-user capacity thresholds under which the full-capacity Maddah-Ali-Niesen delay is still achievable. The achievability proof is via Algorithm 1, and the converse uses an augmented-system argument that invokes a lower bound from [36].

Significance. If the theorem is correct, the paper provides a crisp constant-factor characterization of coded caching over uneven-capacity broadcast channels and shows that the worst-user bottleneck does not destroy the multicast gain beyond a factor of 4. The proposed scheme is explicit, the achievable delay is a closed-form expression with no fitted parameters, and the converse relies on an external lower bound rather than on circular reasoning. The paper also gives a falsifiable quantitative prediction (the threshold condition of Corollary 1). However, the achievability proof as written omits one power layer, and the converse's subset lower bound is asserted rather than proved; both are repairable, but they currently prevent the theorem from being fully established.

major comments (2)

[Section IV-B, Algorithm 1, Eq. (24)] The algorithm defines power layers only for k in [K-Kgamma-1], and Eq. (24) takes the delay maximum over the same range. However, the XORs defined in Eq. (15) exist for every k in [1,K-Kgamma], and the final layer k=K-Kgamma contains the single XOR X_{K-Kgamma,...,K} = \oplus_{k=K-Kgamma}^K W_{d_k,{K-Kgamma,...,K}\{k}}. Each user in {K-Kgamma,...,K} needs one subfile from this XOR, so the procedure as written does not deliver all requested data and does not achieve the delay claimed in Theorem 1. This is a concrete off-by-one error rather than a conceptual one: extending the layer index to k=K-Kgamma and using Eq. (19) for that layer keeps the per-layer delay equal to the right-hand side of Eq. (25), since |X_{K-Kgamma}|=1. Please correct Algorithm 1, the statement that the scheme uses 'K-Kgamma-1 power layers' in Section IV-B, and the range in Eq. (24).
[Section V, Eq. (26)] The converse lower-bounds the augmented-system delay by (1/alpha_w) * (1/2) * w(1-gamma)/(1+w*gamma), citing [36] for 'a system with w cache-aided users.' The augmented system, however, has K users, and the extra K-w users have caches and receive transmissions. It is not immediate that the w-user lower bound of [36] applies to the first w users of this larger network; the extra users could interact with the multicast structure, and the paper gives no cut argument. Since this lower bound is the basis for the factor-4 gap, the proof of Theorem 1 is incomplete at this point. Please add a lemma that justifies the subset lower bound, or state precisely which result in [36] yields it and why the presence of the extra users does not invalidate it.

minor comments (5)

[Section IV-B, Algorithm 1] The pseudo-code is hard to parse: Step 3 defines beta_k inside a loop and is immediately followed by another loop 'for all k in [K-Kgamma-1]' containing Steps 4-7. Please rewrite it to separate the precomputation of the power exponents and rates from the transmission loop, and clarify that in each time slot one XOR from each non-empty layer is transmitted simultaneously.
[Section V, Eq. (28)] The symbol 'T_e' in Eq. (28) appears to be a typo for 'T_aug' (or possibly 'T^*'), and the two-line fraction in Eq. (26) is difficult to read; please clean up the notation.
[Section IV-D, Eq. (24)] The expression '|X_k|(K Kgamma) * 1/r_k' is notationally confusing: the delay should be |X_k| / C(K,Kgamma) * 1/r_k, because each XOR has size 1/C(K,Kgamma) of a file. Please make the division explicit.
[Corollary 1 proof] The word 'Sterling' should be 'Stirling'. The approximate formula used in the proof is informal, but the exact threshold expression in Eq. (10) is what matters, so this is only a presentation issue.
[Section V] There is a small typo in the opening sentence: 'T*(k,gamma,alpha)' should be 'T*(K,gamma,alpha)'. Also, the scalar alpha_w and the capacity vector alpha are both denoted by alpha in Eq. (26); please disambiguate them.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the achievable delay is algorithm-derived, the converse uses an external lower bound, and no fitted parameter is renamed as a prediction.

full rationale

The paper's derivation chain is not circular. The achievable worst-case delay T_sc in Eq. (8) is computed directly from the superposition-coding algorithm: the layer sizes are counted in Eqs. (15)--(17), the rates are set in Eq. (21), and the delay is then the maximum per-layer time in Eq. (24), which reduces algebraically to Eq. (25). No parameter is fitted to the quantity being predicted, and no result is defined in terms of the theorem it supports. The converse in Section V lower-bounds the optimal delay by invoking the factor-2 rate-memory tradeoff of reference [36] for a w-user cache network and applying it to an augmented K-user system; this is an independent, externally established result, not a self-citation of the present authors, and it does not presuppose the claimed factor-4 gap. Corollary 1 is an algebraic consequence of Eq. (8), not a restatement of the input. The self-citations in the paper concern prior related topological or multi-antenna caching schemes and are not load-bearing for the main theorem; in particular, the power-layer construction here is not asserted to follow from those works. Even if Algorithm 1 as written omits the last power layer (a correctness concern about the loop range in Step 3 and the delay maximization range in Eq. (24)), that is an off-by-one implementation issue, not a circularity: it does not make any equation equivalent to its own input by construction. The paper is therefore self-contained against external benchmarks for its central claim, so the circularity score is 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The paper introduces no new entities and fits no free parameters. Its results rest on the GDoF modeling assumption, the standard integer-subpacketization assumption, and an external factor-2 lower bound from [36] used as a black box in the converse.

assumptions (3)

domain assumption Under the GDoF framework, the normalized capacity alpha_k equals the achievable rate r_k for user k.
Used throughout Section II and in the theorem to map channel strengths to rates; the factor-4 result is a GDoF-limit statement, not an exact finite-SNR capacity result.
standard math The optimal delivery time for a w-user cache-aided broadcast system with per-user cache fraction gamma is at least (1/2) w(1-gamma)/(1+wgamma), as established in [36].
Invoked in the converse, Section V Eq (26), to lower-bound the augmented system; the paper does not re-derive or adapt this bound to the presence of the extra K-w users.
domain assumption Kgamma is an integer so that binomial coefficients C(K,Kgamma) and the subpacketization are well-defined.
The placement in Eq (12)-(13) and the delay expressions use S = C(K,Kgamma); the paper does not state this integrality condition explicitly.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Fundamental Limits of Wireless Caching under Uneven-Capacity Channels." pith.science (2026). https://pith.science/paper/PMFCCGAR

@misc{pith2026190804036,
  author       = {Pith},
  title        = {Pith review of: Fundamental Limits of Wireless Caching under Uneven-Capacity Channels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PMFCCGAR}},
  note         = {Machine review of arXiv:1908.04036}
}

read the original abstract

This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known `worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the rate of transmission of each multicasting message to be reduced to that of the slowest user. This bottleneck, which can be detrimental in general wireless broadcast settings, motivates the analysis of coded caching over a standard Single-Input-Single-Output (SISO) Broadcast Channel (BC) with K cache-aided receivers, each with a generally different channel capacity. For this setting, we design a communication algorithm that is based on superposition coding that capitalizes on the realization that the user with the worst channel may not be the real bottleneck of communication. We then proceed to provide a converse that shows the algorithm to be near optimal, identifying the fundamental limits of this setting within a multiplicative factor of 4. Interestingly, the result reveals that, even if several users are experiencing channels with reduced capacity, the system can achieve the same optimal delivery time that would be achievable if all users enjoyed maximal capacity.

Figures

Figures reproduced from arXiv: 1908.04036 by the authors.

**Figure 1.** The plot presents the threshold αth,k for the case of K = 100 users. We can see that as γ decreases, an ever increasing fraction of users can have a further reduced channel capacity without any performance degradation with respect to the maximal-capacity delay. Given any user k, αth,k = 1 − ( K−k Kγ+1) ( K Kγ+1) provides a threshold channel capacity that allows the algorithm to achieve the baseline unit-capacity per… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

[14]

Wireless coded caching: A topological perspec- tive,

J. Zhang and P. Elia, “Wireless coded caching: A topological perspec- tive,” in IEEE Int. Symp. on Inf. Theory (ISIT) , June 2017

work page 2017
[36]

Characterizing the rate-memory tradeoff in cache networks within a factor of 2,

Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Characterizing the rate-memory tradeoff in cache networks within a factor of 2,” IEEE Transactions on Information Theory , vol. 65, pp. 647–663, Jan 2019

work page 2019
[1]

Fundamental limits of caching,

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

work page 2014
[2]

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 Trans. on Inf. Theory , vol. 62, no. 10, pp. 5524–5537, 2016

work page 2016
[3]

Adding transmitters dramatically boosts coded- caching gains for ﬁnite ﬁle sizes,

E. Lampiris and P. Elia, “Adding transmitters dramatically boosts coded- caching gains for ﬁnite ﬁle sizes,” IEEE Journal on Selected Areas in Communication (JSAC), Special Issue on Caching , June 2018

work page 2018
[4]

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, pp. 5821–5833, Sep. 2017

work page 2017
[5]

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 Infor- mation Theory , vol. 64, pp. 3099–3120, April 2018

work page 2018
[6]

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 , vol. 64, pp. 5755–5766, Aug 2018

work page 2018

Show all 36 references

[7]

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

H. H. S. C and P. Krishnan, “Low subpacketization coded caching via projective geometry for broadcast and D2D networks,” CoRR, vol. abs/1902.08041, 2019

1902 arXiv
[8]

A new design framework on device-to-device coded caching with optimal rate and signiﬁcantly less subpacketiza- tions,

X. Zhang and M. Ji, “A new design framework on device-to-device coded caching with optimal rate and signiﬁcantly less subpacketiza- tions,” CoRR, vol. abs/1901.07057, 2019

1901 arXiv
[9]

Coded caching for hetero- geneous systems: An optimization perspective,

A. M. Ibrahim, A. A. Zewail, and A. Yener, “Coded caching for hetero- geneous systems: An optimization perspective,” IEEE Transactions on Communications, pp. 1–1, 2019

2019
[10]

Centralized caching with unequal cache sizes,

B. Asadi, L. Ong, and S. J. Johnson, “Centralized caching with unequal cache sizes,” in IEEE Inf. Theory Workshop (ITW) , Nov 2018

2018
[11]

Decentralized caching and coded delivery with distinct cache capacities,

M. Mohammadi Amiri, Q. Yang, and D. Gündüz, “Decentralized caching and coded delivery with distinct cache capacities,” IEEE Transactions on Communications , vol. 65, pp. 4657–4669, Nov 2017

2017
[12]

Full coded caching gains for cache-less users,

E. Lampiris and P. Elia, “Full coded caching gains for cache-less users,” IEEE Information Theory Workshop (ITW) , 2018

2018
[13]

On the coded caching based wireless video transmission scheme,

L. Zheng, Z. Wang, Q. Yan, Q. Chen, and X. Tang, “On the coded caching based wireless video transmission scheme,” in IEEE/CIC Inter . Conf. on Comm. in China (ICCC) , pp. 1–6, July 2016

2016
[15]

Scalable content delivery with coded caching in multi-antenna fading channels,

K. Ngo, S. Yang, and M. Kobayashi, “Scalable content delivery with coded caching in multi-antenna fading channels,” IEEE Transactions on Wireless Communications, vol. 17, pp. 548–562, Jan 2018

2018
[16]

Alpha fair coded caching,

A. Destounis, M. Kobayashi, G. Paschos, and A. Ghorbel, “Alpha fair coded caching,” in 15th International Symp. on Modeling and Opt. in Mobile, Ad Hoc, and Wireless Networkss (WiOpt) , pp. 1–8, May 2017

2017
[17]

Content delivery in erasure broadcast channels with cache and feedback,

A. Ghorbel, M. Kobayashi, and S. Yang, “Content delivery in erasure broadcast channels with cache and feedback,” IEEE Transactions on Information Theory , vol. 62, pp. 6407–6422, Nov 2016

2016
[18]

Cache-aided content delivery over erasure broadcast channels,

M. Mohammadi Amiri and D. Gündüz, “Cache-aided content delivery over erasure broadcast channels,” IEEE Transactions on Communica- tions, vol. 66, pp. 370–381, Jan 2018

2018
[19]

Decentralized joint cache- channel coding over erasure broadcast channels,

S. Kamel, M. Sarkiss, and M. Wigger, “Decentralized joint cache- channel coding over erasure broadcast channels,” in IEEE Middle East and North Africa Comm. Conf. (MENACOMM) , pp. 1–6, April 2018

2018
[20]

Coding across heterogeneous parallel erasure broadcast channels is useful,

S. Kim, S. Mohajer, and C. Suh, “Coding across heterogeneous parallel erasure broadcast channels is useful,” in IEEE International Symposium on Information Theory (ISIT) , pp. 1883–1887, June 2017

2017
[21]

Noisy broadcast networks with receiver caching,

S. Saeedi Bidokhti, M. Wigger, and R. Timo, “Noisy broadcast networks with receiver caching,” IEEE Transactions on Information Theory , vol. 64, pp. 6996–7016, Nov 2018

2018
[22]

Cache-aided cooperation with no CSIT,

E. Lampiris, J. Zhang, and P. Elia, “Cache-aided cooperation with no CSIT,” in IEEE Int. Symp. on Inf. Theory (ISIT) , June 2017

2017
[23]

Generalized degrees of freedom of the symmetric cache-aided MISO broadcast channel with partial CSIT,

E. Piovano, H. Joudeh, and B. Clerckx, “Generalized degrees of freedom of the symmetric cache-aided MISO broadcast channel with partial CSIT,” IEEE Transactions on Information Theory , pp. 1–1, 2019

2019
[24]

Physical-layer schemes for wireless coded caching,

S. P. Shariatpanahi, G. Caire, and B. Hossein Khalaj, “Physical-layer schemes for wireless coded caching,” IEEE Transactions on Information Theory, vol. 65, pp. 2792–2807, May 2019

2019
[25]

Multi- antenna interference management for coded caching,

A. Tölli, S. P. Shariatpanahi, J. Kaleva, and B. Khalaj, “Multi- antenna interference management for coded caching,” arXiv preprint arXiv:1711.03364, 2017

2017 arXiv
[26]

Multicast beam- former design for coded caching,

A. Tölli, S. P. Shariatpanahi, J. Kaleva, and B. Khalaj, “Multicast beam- former design for coded caching,” in IEEE International Symposium on Information Theory (ISIT) , pp. 1914–1918, June 2018

1914
[27]

A low-complexity cache- aided multi-antenna content delivery scheme,

J. Zhao, M. M. Amiri, and D. Gündüz, “A low-complexity cache- aided multi-antenna content delivery scheme,” in IEEE Int. Workshop on Signal Processing Advances in Wireless Comm. (SPA WC), July 2019

2019
[28]

Subpacketization-rate trade-off in multi-antenna coded caching,

M. Salehi, A. Tölli, S. P. Shariatpanahi, and J. Kaleva, “Subpacketization-rate trade-off in multi-antenna coded caching,” arXiv preprint arXiv:1905.04349 , 2019

1905 arXiv
[29]

Cache-aided communications with multiple antennas at ﬁnite SNR,

I. Bergel and S. Mohajer, “Cache-aided communications with multiple antennas at ﬁnite SNR,” IEEE Journal on Selected Areas in Communi- cations, vol. 36, pp. 1682–1691, Aug 2018

2018
[30]

Caching and coded delivery over gaussian broadcast channels for energy efﬁciency,

M. M. Amiri and D. Gündüz, “Caching and coded delivery over gaussian broadcast channels for energy efﬁciency,” IEEE Journal on Selected Areas in Communications , vol. 36, pp. 1706–1720, Aug 2018

2018
[31]

Generalized Degrees of Freedom of the symmetric Gaussian K user Interference Channel,

S. A. Jafar and S. Vishwanath, “Generalized Degrees of Freedom of the symmetric Gaussian K user Interference Channel,” IEEE Transactions on Information Theory , vol. 56, pp. 3297–3303, July 2010

2010
[32]

Aligned image sets under channel uncertainty: Settling conjectures on the collapse of degrees of freedom under ﬁnite precision CSIT,

A. Gholami Davoodi and S. A. Jafar, “Aligned image sets under channel uncertainty: Settling conjectures on the collapse of degrees of freedom under ﬁnite precision CSIT,” IEEE Transactions on Information Theory , vol. 62, pp. 5603–5618, Oct 2016

2016
[33]

Generalized degrees of freedom of the symmetric K user interference channel under ﬁnite precision CSIT,

A. Gholami Davoodi and S. A. Jafar, “Generalized degrees of freedom of the symmetric K user interference channel under ﬁnite precision CSIT,” IEEE Trans. Inf. Theory , vol. 63, pp. 6561–6572, Oct 2017

2017
[34]

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,” in IEEE Int. Work- shop on Signal Processing Advances in Wireless Comm. (SPA WC), 2019

2019
[35]

Achieving full multiplexing and unbounded caching gains with bounded feedback resources,

E. Lampiris and P. Elia, “Achieving full multiplexing and unbounded caching gains with bounded feedback resources,” IEEE International Symposium on Information Theory (ISIT) , 2018

2018

Pith tools

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

[1] [14]

Wireless coded caching: A topological perspec- tive,

J. Zhang and P. Elia, “Wireless coded caching: A topological perspec- tive,” in IEEE Int. Symp. on Inf. Theory (ISIT) , June 2017

work page 2017

[2] [36]

Characterizing the rate-memory tradeoff in cache networks within a factor of 2,

Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Characterizing the rate-memory tradeoff in cache networks within a factor of 2,” IEEE Transactions on Information Theory , vol. 65, pp. 647–663, Jan 2019

work page 2019

[3] [1]

Fundamental limits of caching,

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

work page 2014

[4] [2]

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 Trans. on Inf. Theory , vol. 62, no. 10, pp. 5524–5537, 2016

work page 2016

[5] [3]

Adding transmitters dramatically boosts coded- caching gains for ﬁnite ﬁle sizes,

E. Lampiris and P. Elia, “Adding transmitters dramatically boosts coded- caching gains for ﬁnite ﬁle sizes,” IEEE Journal on Selected Areas in Communication (JSAC), Special Issue on Caching , June 2018

work page 2018

[6] [4]

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, pp. 5821–5833, Sep. 2017

work page 2017

[7] [5]

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 Infor- mation Theory , vol. 64, pp. 3099–3120, April 2018

work page 2018

[8] [6]

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 , vol. 64, pp. 5755–5766, Aug 2018

work page 2018