LP decodable permutation codes based on linearly constrained permutation matrices

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 139-143

  Wadayama, Tadashi ^a   Hagiwara, Manabu ^b,c  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^c CHUO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDIAN DISTANCE; LINEAR CONSTRAINTS; LP DECODING; PERMUTATION CODES; PERMUTATION MATRIX; POLYTOPES; PROBABILISTIC METHODS; THEORETICAL RESULT;

DECODING; INFORMATION THEORY;

MATRIX ALGEBRA;

EID: 80054794642     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033769     Document Type: Conference Paper

References (19)

1. I. F. Blake, G. Cohen, and M. Deza, "Coding with permutations", Inform. Contr., vol. 43, pp. 1-19, 1979.
2. C. J. Colbourn, T. Kløve, and A. C. H. Ling, "Permutation arrays for powerline communication and mutually orthogonal latin squares", IEEE Transactions on Information Theory, vol. 54, No. 6, June, 2004.
3. G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles", in Codes, Systems, and Graphical Models (B. Marcus and J. Rosenthal, eds.), vol. 123 of IMA Vol. Math. Appl., pp. 101-112, Springer Verlag, New York, Inc., 2001.
4. C. Ding, F. W. Fu, T. Kløve and V. K. W. Wei, "Constructions of permutation arrays", IEEE Transactions on Information Theory, vol. 48, no. 4, Apr. 2002.
5. J. Feldman, "Decoding error-correcting codes via linear programming", Massachusetts Institute of Technology, Ph. D. thesis, 2003.
6. A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck, "Rank modulation for flash memories", in Proc. IEEE Int. Symp. Information Theory, 2008.
7. A. Jiang, M. Schwartz, and J. Bruck, "Error-correcting codes for rank modulation", in Proc. IEEE Int. Symp. Information Theory, 2008.
8. T. Kløve, T. Lin, S.-C. Tsai, and W. G. Tzeng, "Permutation arrays under the Chebyshev distance", IEEE Transactions on Information Theory, vol. 56, no. 6, June 2010.
9. A. J. H. Vinck, "Coded modulation for powerline communications" , AEÜ Int. J. Electron. Commun., vol. 54, pp. 45-49, Jan. 2000.
10. T. Wadayama and A. J. H. Vinck, "A multilevel construction of permutation codes", IEICE Transactions on Fundamentals, vol. E84-A, no. 10, pp. 2518-2522, 2001.
11. D. Slepian, "Permutation modulation", Proc. IEEE, pp. 228-236, 1965.
12. J. Karlof, "Permutation codes for the Gaussian channel", IEEE Trans. Inform. Theory, vol. 35, no. 4, pp. 726-732, July 1989.
13. I. Ingemarsson, "Optimized permutation modulation", IEEE Trans. Inform. Theory, vol. 36, pp. 1098-1100, Sept. 1990.
14. T. Berger, F. Jelinek, and J. K. Wolf, "Permutation codes for sources", IEEE Trans. Inform. Theory, vol. IT-18, pp. 160-169, Jan. 1972.
15. A. Barg and A. Mazumdar, "Codes in permutations and error correction for rank modulation", IEEE Trans. Inform. Theory, vol. IT-56, pp. 3158-3165, July 2010.
16. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes", in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003.
17. G. Birkhoff, "Three observations on linear algebra", Univ. Nac. Tacuman, Rev. Ser. A 5, 147-151, 1946.
18. J. von Neumann, "A certain zero-sum two-person game equivalent to an optimal assignment problem", Ann. Math. Studies 28, 5-12, 1953.
19. T. Wadayama and M. Hagiwara, "LP decodable permutation codes based on linearly constrained permutation matrices", arXiv:1011.6441, 2011.