Decoding frequency permutation arrays under Chebyshev distance

IEEE Transactions on Information Theory

Volumn 56, Issue 11, 2010, Pages 5730-5737

  Shieh, Min Zheng ^a   Tsai, Shi Chun ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Chebyshev distance; frequency permutation array (FPA); locally decodable code; permanent; permutation array (PA)

Indexed keywords

CHEBYSHEV; EFFICIENT ENCODING; LOCALLY DECODABLE CODE; LOWER AND UPPER BOUNDS; MULTISET; PERMANENT; PERMUTATION ARRAYS; PRIVATE INFORMATION RETRIEVAL;

DECODING;

EID: 77958567417     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2069253     Document Type: Article

References (21)

1. A. A. Babaev, "Procedures of encoding and decoding of permutations," Cybern. Syst. Anal., vol.20, no.6, pp. 861-863, Nov. 1984.
2. P. Cappelletti, C. Golla, P. Olivo, and E. Zanoni, Flash Memories. Norwell, MA: Kluwer, 1999.
3. J. C. Chang, R. J. Chen, T. Kløve, and S. C. Tsai, "Distance-preserving mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol.49, pp. 1054-1059, Apr. 2003.
4. K. Efremenko, "3-query locally decodable codes of subexponential length," in Proc. ACM Symp. Theory Comput., 2009, pp. 39-44.
5. S. Huczynska and G. L. Mullen, "Frequency permutation arrays," J. Combinatorial Des., vol.14, pp. 463-478, 2006.
6. A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck, "Rank modulation for flash memories," in Proc. IEEE Int. Symp. Inf. Theory, 2008, pp. 1731-1735.
7. A. Jiang, M. Schwartz, and J. Bruck, "Error-correcting codes for rank modulation," in Proc. IEEE Int. Symp. Inf. Theory, 2008, pp. 1736-1740.
8. T. Kløve, "Spheres of permutations under the infinity norm-Permutations with limited displacement," Dept. of Informatics, Univ. Bergen, Reports in Informatics no. 376, 2008.
9. T. Kløve, "Generating functions for the number of permutations with limited displacement," Electron. J. Combinatorics, vol.16, 2009, #R104.
10. T. Kløve, T.-T. Lin, S.-C. Tsai, and W.-G. Tzeng, "Permutation arrays under the Chebyshev distance," IEEE Trans. Inf. Theory, vol.56, pp. 2611-2617, Jun. 2010.
11. T. T. Lin, S. C. Tsai, and W. G. Tzeng, "Efficient encoding and decoding with permutation arrays," in Proc. IEEE Int. Symp. Inf. Theory, 2008, pp. 211-214.
12. K. W. Shum, "Permutation coding and MFSK modulation for frequency selective channel," in Proc. IEEE Int. Symp. Pers., Indoor, Mobile Radio Commun., Sep. 2002, vol.5, pp. 2063-2066.
13. D. Slepian, "Permutation modulation," Proc. IEEE, vol.53, no.3, pp. 228-236, Mar. 1965.
14. T. G. Swart and H. C. Ferreira, "Decoding distance-preserving permutation codes for power-line communications," presented at the IEEE AFRICON, Windhoek, Namibia, Sep. 26-28, 2007.
15. I. Tamo and M. Schwatz, "Correcting limited-magnitude errors in the rank-modulation scheme," IEEE Trans. Inf. Theory, vol.56, no.6, pp. 2551-2560, Jun. 2010.
16. L. Trevisan, "Some applications of coding theory in computational complexity," Quaderni di Matematica, vol.13, pp. 347-424, 2004.
17. J. H. van Lint and R. M. Wilson, A Course in Combinatiorics, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.
18. A. J. H. Vinck and J. Häring, "Coding and modulation for power-line communications," presented at the Int. Symp. Power Line Commun., Limerick, Ireland, Apr. 2000.
19. A. J. H. Vinck, J. Häring, and T.Wadayama, "Coded M-FSK for power line communications," in Proc. IEEE Int. Symp. Inf. Theory, 2000, p. 137.
20. A. J. H. Vinck, "Coded modulation for powerline communications, " in Proc. Int. J. Electron. Commun, 2000, vol.54, pp. 45-49.
21. S. Yekhanin, "Towards 3-query locally decodable codes of subexponential length," J. ACM, vol.55, no.1, pp. 1-16, 2008.