arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.09794cs.ITmath.COmath.IT
收藏

基于任务的嵌入式索引编码解决方案

Task-based Solutions to Embedded Index Coding

Ishay Haviv

摘要:

在索引编码问题中,发送方持有消息$x \in \{0,1\}^n$,并且希望以使得第$i$个接收方能够检索第$i$个比特$x_i$的方式向$n$个接收方广播信息。每个接收机具有包括$x$的比特的子集的在先辅助信息,并且目标是最小化经由广播信道发送的信息的长度。Porter和Wootters最近引入了嵌入式索引编码模型,其中接收者也扮演发送者的角色,目标是最小化其广播信息的总长度。如果每个接收器仅基于其中一个接收器提供的信息检索其位,则嵌入式索引码被称为基于任务的。本文研究了基于任务的约束对线性嵌入索引编码的影响。它表明,对于某些边信息地图存在一个线性的嵌入式索引码的长度平方小于任何基于任务的嵌入式索引码。结果得到,直到一个乘法常数,两个量之间的最大可能差距。证明是由一个明确的建设和分析涉及频谱技术。

英文摘要:

In the index coding problem a sender holds a message $x \in \{0,1\}^n$ and wishes to broadcast information to $n$ receivers in a way that enables the $i$th receiver to retrieve the $i$th bit $x_i$. Every receiver has prior side information comprising a subset of the bits of $x$, and the goal is to minimize the length of the information sent via the broadcast channel. Porter and Wootters have recently introduced the model of embedded index coding, where the receivers also play the role of the sender and the goal is to minimize the total length of their broadcast information. An embedded index code is said to be task-based if every receiver retrieves its bit based only on the information provided by one of the receivers. This paper studies the effect of the task-based restriction on linear embedded index coding. It is shown that for certain side information maps there exists a linear embedded index code of length quadratically smaller than that of any task-based embedded index code. The result attains, up to a multiplicative constant, the largest possible gap between the two quantities. The proof is by an explicit construction and the analysis involves spectral techniques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑