Fundamental Limits of Coded Caching: The Memory Rate Pair (K - 1 - 1/K, 1/(K-1)). - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (ISIT, 2019)

Pareto Optimal Schemes in Coded Caching. - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (ISIT, 2019)

Towards the Exact Rate Memory Tradeoff in Coded Caching. - Kumar K. P. Vijith; Brijesh Kumar Rai; Tony Jacob (NCC, 2019)

Towards the Exact Memory Rate Tradeoff for the (4, 5) Cache Network. - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (SPCOM, 2020)

Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (ISIT, 2021)

The Exact Rate Memory Tradeoff for Large Caches with Coded Placement. - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (CoRR, 2021)

The Exact Rate Memory Tradeoff for Small Caches with Coded Placement. - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (CoRR, 2021)

The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size. - Vijith Kumar K. P; Brijesh Kumar Rai; Tony Jacob (ITW, 2023)

Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement. - Kumar K. P. Vijith; Brijesh Kumar Rai; Tony Jacob (IEEE Trans. Inf. Theory, 2023)