An Achievable Scheme for Dynamic Index Coding: A Clique Covering Approach

Dynamic index coding extends traditional index coding by handling real-time traffic flows instead of static data batches. In this paper, we propose a dynamic index coding scheme that operates over an arbitrary side information graph. The scheme leverages time-sharing across an optimal clique covering set of the side information graph, achieving coding gains with a guaranteed lower bound. Additionally, convex optimization is employed to refine the time-sharing coefficients, minimizing the transmission delay. Numerical results show that the optimization process can achieve a typical 10% reduction in the transmission delay, demonstrating the efficiency of the proposed approach.