Improved delivery rate-cache capacity trade-off for centralized coded caching

Centralized coded caching problem, in which a server with N distinct files, each with the size of F bits, serves K users, each equipped with a cache of capacity MF bits, is considered. The server is allowed to proactively cache contents into user terminals during the placement phase, without knowing the particular user requests. After the placement phase, each user requests one of the N files from the server, and all the users' requests are satisfied simultaneously by the server through an error-free shared link during the delivery phase. A novel coded caching algorithm is proposed, which is shown to achieve a smaller delivery rate compared to the existing coded caching schemes in the literature for a range of N and K values; particularly when the number of files is larger than the number of users in the system.