Loading...
 
[Show/Hide Left Column]

Index Coding

Novel outer bounds through sub-modular pseudo-entropic functionals and non-Shannon type inequalities


Beginning : 2014
Action Line : ComEx
Subject : Basic storage limitations for shared link delivery networks and combination networks
Directors : Pablo Piantanida,L2S, Daniela Tuninetti,UIC
Institutions :L2S - CentraleSupelec & ECE - University of Illinois at Chicago, IL, USA
Administrator laboratory : L2S
Phd Student : Wan KAI
Link from theses.fr : Thèse Wan Kai - June 29, 2018
Scientifical productions :
  • Caching in combination networks: Novel multicast message generation and delivery by leveraging the network topology K Wan, M Ji, P Piantanida, D Tuninetti 2018 IEEE International Conference on Communications (ICC), 1-6
  • On cache-aided relay networks K Wan, D Tuninetti, P Piantanida, M Ji The 22nd International ITG Workshop on Smart Antennas (WSA 2018)
  • On Combination Networks with Cache-aided Relays and Users K Wan, D Tuninetti, P Piantanida, M Ji WSA 2018; 22nd International ITG Workshop on Smart Antennas, 1-7
  • Recent advances on combination networks with end-user caches W Kai, M Ji, P Piantanida, D Tuninetti Information Theory and Applications Workshop (ITA)
  • Novel outer bounds for combination networks with end-user-caches K Wan, M Ji, P Piantanida, D Tuninetti Information Theory Workshop (ITW), 2017 IEEE, 444-448
  • Combination networks with caches: Improved achievable scheme based on interference alignmentK Wan, M Ji, P Piantanida, D Tuninetti 51nd Asilomar Conference on Signals, Systems and Computers, 2017
  • State-of-the-art in cache-aided combination networks K Wan, D Tuninetti, M Ji, P Piantanida Signals, Systems, and Computers, 2017 51st Asilomar Conference on, 641-645
  • Novel inner bounds with uncoded cache placement for combination networks with end-user-caches K Wan, M Ji, P Piantanida, D Tuninetti Communication, Control, and Computing (Allerton), 2017 55th Annual Allerton …
  • Novel delivery schemes for decentralized coded caching in the finite file size regime K Wan, D Tuninetti, P Piantanida Communications Workshops (ICC Workshops), 2017 IEEE International Conference …
  • A novel index coding scheme and its application to coded caching K Wan, D Tuninetti, P Piantanida Information Theory and Applications Workshop (ITA), 2017, 1-6
  • On the optimality of uncoded cache placement K Wan, D Tuninetti, P Piantanida Information Theory Workshop (ITW), 2016 IEEE, 161-165
  • On caching with more users than files K Wan, D Tuninetti, P Piantanida Information Theory (ISIT), 2016 IEEE International Symposium on, 135-139

Context :
The classical cut-set bound is not tight is general. In the NetCod literature it is well known the characterizing the general NetCod capacity is equivalent to the characterization of closure of the entropic region. The problem is open for more than three random variables, in which case the complete characterization of entropic region is not possible by using a finite number of linear inequalities. In particular, Shannon-type inequalities (based on the nonnegativity of mutual information) are in general non sufficient for NetCod. These results motivate the need to go beyond cut-set bounds and Shannon-type inequalities in order to tightly characterize the NetCod capacity. As index coding is equivalent to NetCod, the characterization of the index coding capacity necessitate new outer bound tools. Available results from the literature suggest that sub-modular pseudo-entropic functionals are a good avenue to explore as they naturally generalize the well-known concept of entropy function as introduce by Shannon.

Information :
Note that due to personal constraints, Daniela Tuninetti had to return to University of Illinois at Chicago without completing the full program she had prepared. She could however maintain her work with Wan Kai, in cooperation with Pablo Piantanida.