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

无穷范数下的频率排列阵列译码

Decoding Frequency Permutation Arrays under Infinite norm

Min-Zheng Shieh, Shi-Chun Tsai

摘要:

具有长度$n=mλ$和距离$d$的频率置换阵列(FPA)是在$m$符号上的多集合上的置换的集合,其中每个符号精确地出现$λ$次,并且阵列中的任何两个元素之间的距离至少为$d$。FPA推广了置换数组的概念。在距离度量$\ell_\infty$ -范数下,本文首先证明了FPA的大小的上下界。然后给出了一种具有高效编解码能力的FPA结构。此外,我们表明我们的设计是本地可解码的,即,我们可以通过读取至多$λ+1$符号来解码消息位,这对于私人信息检索具有有趣的应用。

英文摘要:

A frequency permutation array (FPA) of length $n=mλ$ and distance $d$ is a set of permutations on a multiset over $m$ symbols, where each symbol appears exactly $λ$ times and the distance between any two elements in the array is at least $d$. FPA generalizes the notion of permutation array. In this paper, under the distance metric $\ell_\infty$-norm, we first prove lower and upper bounds on the size of FPA. Then we give a construction of FPA with efficient encoding and decoding capabilities. Moreover, we show our design is locally decodable, i.e., we can decode a message bit by reading at most $λ+1$ symbols, which has an interesting application for private information retrieval.

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

↑