Vehicle to Vehicle (V2V) communication phase is an integral part of collaborative message dissemination in vehicular ad-hoc networks (VANETs). In this work, we apply index coding techniques to reduce the number of transmissions required for data exchange. The index coding problem has a sender, which tries to meet the demands of several receivers in a minimum number of transmissions. All these receivers have some prior knowledge of the messages, known as the side-information. In this work, we consider a particular case of the index coding problem, where multiple nodes want to share information among them. Under this set up, lower bound on the number of transmissions is established when the cardinality of side-information is the same. An optimal solution to achieve the bound in a special case of VANET scenario is presented. For this special case, we consider the link between the nodes to be error-prone, and in this setting, we construct optimal linear error correcting index codes.

中文翻译：

---

车对车通信中的索引编码

车对车 (V2V) 通信阶段是车载自组织网络 (VANET) 中协作消息传播的一个组成部分。在这项工作中，我们应用索引编码技术来减少数据交换所需的传输次数。索引编码问题有一个发送方，它试图以最少的传输次数满足多个接收方的需求。所有这些接收器都对消息有一些先验知识，称为边信息。在这项工作中，我们考虑索引编码问题的一个特殊情况，其中多个节点想要在它们之间共享信息。在这种设置下，当边信息的基数相同时，就建立了传输次数的下限。提出了在 VANET 场景的特殊情况下实现边界的最佳解决方案。对于这种特殊情况，