August 14, 2017

Coded Caching with Linear Subpacketization is Possible using Ruzsa-Szemeredi Graphs

  • Dimakis A.
  • Shanmugam K.
  • Tulino A.

Coded caching is a problem where encoded broadcasts are used to satisfy users requesting popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen showed that it is possible to satisfy a scaling number of users with only a constant number of broadcast transmissions by exploiting coding and caching. Unfortunately, all previous schemes required the splitting of files into an exponential number of packets before the significant coding gains of caching appeared. The question of what can be achieved with polynomial subpacketization (in the number of users) has been a central open problem in this area. We resolve this problem and present the first coded caching scheme with polynomial (in fact, linear) subpacketization. We obtain a number of transmissions that is not constant, but can be any polynomial in the number of users with an exponent arbitrarily close to zero. Our central technical tool is a novel connection between Ruzsa-Szemeredi graphs and coded caching.

View Original Article

Recent Publications

January 01, 2018

Fair Dynamic Spectrum Management for QRD-Based Precoding with User Encoding Ordering in Downstream Transmission

In next generation DSL networks such as, employing discrete multi-tone transmission in high frequencies up to 212 MHz, the crosstalk among lines reaches very high levels. To precompensate the crosstalk in downstream transmission, QRD-based precoding has been proposed as a near-optimal dynamic spectrum management (DSM) technique. However, the performance ...

January 01, 2018

Practical Mitigation of Passive Intermodulation in Microstrip Circuits

This paper presents new experimental evidence and a novel practical approach for mitigation of passive intermodulation (PIM) in microstrip circuits fabricated on commercial printed circuit board laminates. The mechanisms of distributed PIM in microstrip circuits are reviewed and a phenomenology of PIM generation due to locally enhanced electromagnetic fields at ...

January 01, 2018

Efficient Cooperative HARQ for Multi-Source Multi-Relay Wireless Networks

In this paper, we compare the performance of three different cooperative Hybrid Automatic Repeat reQuest (HARQ) protocols for slow-fading half-duplex orthogonal multiple access multiple relay channel. Channel State Information (CSI) is available at the receiving side of each link only. Time Division Multiplexing is assumed, where each orthogonal transmission occurs ...