• Chair of ICC workshop on Advanced Caching for Wireless Networks (co-organized with Georgios Paschos and Mari Kobayashi), ICC Paris, May 2017. Details
  • Tutorial @ 5G Wireless Summer School: Advanced Wireless Caching (P.Elia), Dresden, Sept 20th. Details
  • Invited talk on Caching at Tyrrhenian Int. Workshop. Livorno - Sept 12th. Details
  • Netcod-16 submission: ``Synergistic Gains of Feedback-Aided Coded Caching''.
  • Paper ``Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback'' accepted at Allerton Conference 2016. Details
  • Tutorial@Sigmetrics-16: Caching in Wireless Networks (P. Elia and G. Paschos). Details
  • Tutorial@ICC-2016: Wireless caching for 5G: network coding and PHY. (P. Elia) Details
  • Hosting Dr. Ejder Bastug from Huawei/Supelec Paris: topic - caching. Details
  • Welcome Felix Engelmann - PhD student (co-supervised with Gerhard Kramer). Details
  • Awarded LABEX Postdoc Grant (information theory for surveillance). Details
  • Awarded Jeunes Chercheurs Grand (ECOLOGICAL-BITS-AND-FLOPS). Details
  • Welcome Eleftherios Lampiris - New PhD student (topic - caching). Details


My research focuses mainly on wireless communications, information theory and coding theory, and lately on the intersection of coded caching and feedback-aided multiuser communications, exploring a broad spectrum of aspects that include:

  1. Fundamental limits of memory-aided (cache-aided) communications
  2. Algorithms that efficiently use memory
  3. Memory as a means for reducing the implementation complexity of networks
  4. The relationship between memory and network topology
  5. The use of memory in advanced communication paradigms such as massive MIMO, ultra high frequency communications, cloud-based communications (cloud RAN)
  6. Practical implementation and prototyping of novel memory aided algorithms.

The elusive tradeoff between memory, performance, complexity and feedback:

In the back of our head is always the elusive tradeoff between memory, performance, complexity and feedback, where roughly speaking

`memory’ = GBytes of storage

performance = achievable rates and reliability

complexity = flops (computational complexity) or implementation complexity

feedback = learn the network, and disseminate learned info around the network.

This meaningful tradeoff (memory, performance, complexity and feedback are intimately intertwined) stands to define future research and practice in communication networks. In deriving the fundamental properties of these intertwined relationship leads to fascinating links with different areas such as

  • combinatorial design, projective geometry, resolvability of affine plances
  • discrete mathematics, statistical physics
  • as well as information theory, complexity theory, lattices, optimization theory and many others.

Other work: Other work of mine included:

  • design of multiuser communications with imperfect (and delayed) feedback
  • MIMO transceivers
  • complexity of communication* isolation and connectivity in dense networks
  • queueing theory and cross-layer design
  • coding theory (association schemes and algebraic combinatoris)
  • cooperative communications
  • soft-biometrics and surveillance systems.



Jingjing Zhang

Feedback-aided caching in wireless communications

Hyper-graphs, t-designs, association schemes.

Interference management for environmental-friendly networks

Eleftherios Lampiris

Memory aided communications in novel communication paradigms

Felix Engelmann

Index coding in memory-aided communications: performance and security