Decentralized Pliable Index Coding (DPIC) problem addresses efficient information exchange in distributed systems where clients communicate among themselves without a central server. An important consideration in DPIC is the heterogeneity of side-information and demand sizes. Although many prior works assume homogeneous settings with identical side-information cardinality and single message demands, these assumptions limit real-world applicability where clients typically possess unequal amounts of prior information. In this paper, we study DPIC problem under heterogeneous side-information cardinalities. We propose a transmission scheme that coordinates client broadcasts to maximize coding efficiency while ensuring that each client achieves a common target level $T$. In addition, we impose a strict security constraint that no client acquires more than the target $T$ number of messages, guaranteeing that each client ends up with exactly $T$ messages. We analyze the communication cost incurred by the proposed scheme under this security constraint.

翻译：去中心化可塑性索引编码（DPIC）问题旨在解决分布式系统中客户端在无中心服务器情况下进行高效信息交换的挑战。DPIC中一个关键考量因素是边信息与需求规模的异质性。尽管先前许多研究假设同构场景，即边信息基数相同且需求为单一消息，但这些假设限制了在实际场景中的应用，因为客户端通常拥有不等量的先验信息。本文研究边信息基数异构条件下的DPIC问题。我们提出一种传输方案，通过协调客户端广播来最大化编码效率，同时确保每个客户端达到共同目标层级$T$。此外，我们施加严格的安全约束：任何客户端获取的消息数量不得超过目标值$T$，从而保证每个客户端最终恰好获得$T$条消息。在此安全约束下，我们分析了所提方案产生的通信开销。