Decoding Frequency Permutation Arrays under Infinite norm
| dc.creator | Shieh, Min-Zheng | |
| dc.creator | Tsai, Shi-Chun | |
| dc.date | 2009-01-14 | |
| dc.date.accessioned | 2026-07-07T12:29:30Z | |
| dc.date.available | 2026-07-07T12:29:30Z | |
| dc.description | 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. | |
| dc.description | Submitted to ISIT 2009 | |
| dc.identifier | https://arxiv.org/abs/0901.1971 | |
| dc.identifier | http://arxiv.org/abs/0901.1971 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215896 | |
| dc.subject | Information Theory | |
| dc.title | Decoding Frequency Permutation Arrays under Infinite norm | |
| dc.type | text |