標題: Decoding Frequency Permutation Arrays Under Chebyshev Distance
作者: Shieh, Min-Zheng
Tsai, Shi-Chun
資訊工程學系
Department of Computer Science
關鍵字: Chebyshev distance;frequency permutation array (FPA);locally decodable code;permanent;permutation array (PA)
公開日期: 1-十一月-2010
摘要: A frequency permutation array (FPA) of length n = m lambda and distance d is a set of permutations on a multiset over m symbols, where each symbol appears exactly lambda 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 Chebyshev distance, we first prove lower and upper bounds on the size of FPA. Then we give several constructions of FPAs, and some of them come with efficient encoding and decoding capabilities. Moreover, we show one of our designs is locally decodable, i.e., we can decode a message bit by reading at most lambda + 1 symbols, which has an interesting application to private information retrieval.
URI: http://dx.doi.org/10.1109/TIT.2010.2069253
http://hdl.handle.net/11536/31994
ISSN: 0018-9448
DOI: 10.1109/TIT.2010.2069253
期刊: IEEE TRANSACTIONS ON INFORMATION THEORY
Volume: 56
Issue: 11
起始頁: 5730
結束頁: 5737
顯示於類別:期刊論文


文件中的檔案:

  1. 000283449000024.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。