Guanchen He

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we show how to partition <i>K</i> users in a coded caching domain into <i>L</i> groups to reduce the complexity from <i>O</i>(2<sup><i>K</i></sup>) to [EQUATION]. We first show that the negative effects of the heterogeneity of cache sizes and partitioning on coded caching performance neutralize each other, which is the theoretical foundation(More)
  • 1