On the greedy coded caching scheme

Coded caching is a technique that receives much attention in the network literature, since it is able to achieve significant gains compared to the conventional uncoded caching schemes. In this paper, we first identify a family of placement and delivery schemes. Then we derive a lower bound on the average rate for the identified schemes. Based on the clue in deriving the lower bound, a new delivery algorithm is proposed to pursue full multicast adaptively, which can exploit more cooperative opportunities compared to the known schemes. Particularly, the proposed scheme has the advantage that, when the file size is not large enough, the proposed scheme is still able to achieve a reasonable coding gain. We perform simulations to validate our design.