M. A. Maddah-ali and U. Niesen, Fundamental limits of caching, IEEE Trans. Infor. Theory, vol.60, issue.5, pp.2856-2867, 2014.

, Decentralized coded caching attains order-optimal memory-rate tradeoff, IEEE/ACM Trans. Networking, vol.23, issue.4, pp.1029-1040, 2015.

M. Ji, A. M. Tulino, J. Llorca, and G. Caire, Order-optimal rate of caching and coded multicasting with random demands, IEEE Trans. Infor. Theory, vol.63, pp.3923-3949, 2017.

K. Wan, D. Tuninetti, and P. Piantanida, On the optimality of uncoded cache placement, 2016 IEEE Infor. Theory Workshop, 2015.

, On caching with more users than files, 2016 IEEE Int. Symp. Inf. Theory (first publicly available in, 2016.

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, 2019.

A. M. Ibrahim, A. A. Zewail, and A. Yener, Device-to-device coded caching with heterogeneous cache sizes, IEEE Int. Conf. Communications (ICC), 2018.

K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, Novel outer bounds for combination networks with end-user-caches, IEEE Inf. Theory Workshop, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01742324

E. Parrinello, A. Unsal, and P. Elia, Coded caching with shared caches: Fundamental limits with uncoded prefetching, 2018.

M. A. Attia and R. Tandon, Approximately optimal distributed data shuffling, IEEE Int. Symp. Inf. Theory, 2018.

C. Wang, S. H. Lim, and M. Gastpar, A new converse bound for coded caching, Inf. Theory and Applications Workshop (ITA), 2016.

M. M. Amiri, Q. Yang, and D. Gunduz, Coded caching for a large number of users, IEEE Inf. Theory Workshop, 2016.

Q. Yu, M. A. Maddah-ali, and A. Salman, The exact rate-memory tradeoff for caching with uncoded prefetching, 2017 IEEE Int. Symp. Inf. Theory (first publicly available in Sep, p.2017, 2016.

C. Tian and J. Chen, Caching and delivery via interference elimination, IEEE Int. Symp. Inf. Theory, pp.830-834, 2016.

Z. Chen, Fundamental limits of caching: Improved bounds for small buffer users, IET Communications, vol.10, issue.17, 2016.

S. Sahraei and M. Gastpar, K users caching two files: An improved achievable rate, Annual Conference on Information Science and Systems (CISS), 2016.

M. M. Amiri and D. Gunduz, Fundamental limits of caching: Improved delivery rate-cache capacity trade-off, IEEE Trans. Communications, vol.65, issue.2, pp.806-815, 2017.

J. Gomez-vilardebo, Fundamental limits of caching: Improved bounds with coded prefetching, 2017.

H. Ghasemi and A. Ramamoorthy, Further results on lower bounds for coded caching, IEEE Int. Symp. Inf. Theory, pp.2319-2323, 2016.

N. Ajaykrishnan, N. S. Prem, V. M. Prabhakaran, and R. Vaze, Critical database size for effective caching, National Conference on Communications (NCC), 2015.

A. Sengupta, R. Tandon, and T. C. Clancy, Improved approximation of storage-rate tradeoff for caching via new outer bounds, IEEE Int. Symp. Inf. Theory, 2015.

C. Tian, Symmetry, demand types and outer bounds in caching systems, IEEE Int. Symp. Inf. Theory, pp.825-829, 2016.

C. Wang, S. S. Bidokhti, and M. Wigger, Improved converses and gap-results for coded caching, IEEE Trans. Infor. Theory, vol.64, issue.11, pp.7051-7062, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02287708

T. M. Cover and J. A. Thomas, Elements of information theory, 2006.

S. S. Bidokhti, M. Wigger, and A. Yener, Benefits of cache assignment on degraded broadcast channels, IEEE Int. Symp. Inf. Theory, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02439575

Q. Yu, M. A. Maddah-ali, and A. Salman, Characterizing the ratememory tradeoff in cache networks within a factor of 2, IEEE Int. Symp. Inf. Theory, 2017.

K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, Novel outer bounds with uncoded cache placement for combination networks with end-usercaches, IEEE Inf. Theory Workshop (ITW), 2017.

F. Arbabjolfaei, B. Bandemer, Y. Kim, E. Sasoglu, and L. Wang, On the capacity region for index coding, IEEE Int. Symp. Inf. Theory, 2013.

T. S. Han, The capacity region of general multiple-access channel with certain correlated sources, Inf. Contr, vol.40, issue.1, pp.37-60, 1979.

D. Slepian and J. K. Wolf, Noiseless coding of correlated information sources, IEEE Trans. Infor. Theory, vol.19, issue.4, pp.471-480, 1973.

A. E. Gamal and Y. Kim, Network information theory, 2011.

K. Wan, Fundamental limits of cache-aided shared-link broadcast networks and combination networks, 2018.
URL : https://hal.archives-ouvertes.fr/tel-01842269

Y. Birk and T. Kol, Informed source coding on demand (iscod) over broadcast channels, Proc. IEEE Conf. Comput. Commun, pp.1257-1264, 1998.

F. Arbabjolfaei and Y. Kim, Fundamentals of index coding, Foundations and Trends in Communications and Information Theory, vol.14, pp.163-346, 2018.

A. Blasiak, R. Kleinberg, and E. Lubetzky, Lexicographic products and the power of non-linear network coding, IEEE 52nd Annu, pp.609-618, 2011.

Y. Liu, P. Sadeghi, F. Arbabjolfaei, and Y. Kim, On the capacity for distributed index coding, IEEE Int. Symp. Inf. Theory, 2017.

B. Bandemer, A. E. Gamal, and Y. H. Kim, Simultaneous nonunique decoding is rate-optimal, Proc. 50th Allerton Conf, pp.9-16, 2012.

K. Wan, He is currently a post-doctoral researcher with the Communications and Information Theory Chair (CommIT) at Technische Universität Berlin, S '15 -M '18) received the M.Sc. and Ph.D. degrees in Communications from Université Paris Sud-CentraleSupélec, 2014.

, Tuninetti is a recipient of a best paper award at the European Wireless Conference in 2002, of an NSF CAREER award in 2007, and named University of Illinois Scholar in 2015. Dr. Tuninetti was the editor-in-chief of the IEEE Information Theory Society Newsletter from, which she joined in 2005. Dr. Tuninetti got her Ph.D. in Electrical Engineering in 2002 from ENST/Télécom ParisTech, 2002.

. Dr, Tuninetti's research interests are in the ultimate performance limits of wireless interference networks (with special emphasis on cognition and user cooperation), coexistence between radar and communication systems, multirelay networks, content-type coding, cache-aided systems and distributed private coded computing

P. Piantanida, he has joined the Laboratoire des Signaux et Systèmes (L2S), at CentraleSupélec together with CNRS (UMR 8506) and Université Paris-Sud, as an Associate Professor of Network Information Theory. He is currently associated with Montreal Institute for Learning Algorithms (Mila) at Université de Montréal, SM '16) received both B.Sc. in Electrical Engineering and the M.Sc (with honors) from the University of Buenos Aires (Argentina) in 2003, and the Ph.D. from Université Paris-Sud, 2007.