Decoding Frequency Permutation Arrays Under Chebyshev Distance
| dc.citation.epage | 5737 | en_US |
| dc.citation.issue | 11 | en_US |
| dc.citation.spage | 5730 | en_US |
| dc.citation.volume | 56 | en_US |
| dc.contributor.author | Shieh, Min-Zheng | en_US |
| dc.contributor.author | Tsai, Shi-Chun | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:47:55Z | |
| dc.date.available | 2014-12-08T15:47:55Z | |
| dc.date.issued | 2010-11-01 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1109/TIT.2010.2069253 | en_US |
| dc.identifier.issn | 0018-9448 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON INFORMATION THEORY | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TIT.2010.2069253 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/31994 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Chebyshev distance | en_US |
| dc.subject | frequency permutation array (FPA) | en_US |
| dc.subject | locally decodable code | en_US |
| dc.subject | permanent | en_US |
| dc.subject | permutation array (PA) | en_US |
| dc.title | Decoding Frequency Permutation Arrays Under Chebyshev Distance | en_US |
| dc.type | Article | en_US |