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

IF 4.4 3区计算机科学 Q2 TELECOMMUNICATIONS

IEEE Communications Letters Pub Date : 2025-06-03 DOI:10.1109/LCOMM.2025.3576278

Mohammad Hadi;Mohammad Mahdi Mojahedian

引用次数: 0

Abstract

Dynamic index coding extends traditional index coding by handling real-time traffic flows instead of static data batches. In this letter, 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.

查看原文本刊更多论文

一种可实现的动态索引编码方案：一种团覆盖方法

动态索引编码通过处理实时流量而不是静态数据批次来扩展传统索引编码。在这封信中，我们提出了一个动态索引编码方案，操作在任意侧信息图。该方案利用了边信息图的最优团覆盖集的分时性，在保证下界的情况下实现了编码增益。此外，采用凸优化方法优化分时系数，使传输延迟最小化。数值结果表明，优化过程可以使传输延迟降低10%，证明了所提方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.