Efficient encoding and decoding with permutation arrays

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 211-214

  Lin, Te Tsung ^a   Tsai, Shi Chun ^a   Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ENCODING; INTERNATIONAL SYMPOSIUM; PERMUTATION ARRAYS;

CODES (SYMBOLS); CYBERNETICS; DECODING; INFORMATION THEORY;

TECHNICAL PRESENTATIONS;

EID: 52349122018     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4594978     Document Type: Conference Paper

References (17)

1. H. Chadwick, L. Kurz, Rank permutation group codes based on Kendall's correlation statistic. Information Theory, IEEE Transactions. Vol. 15(2), 306-315, Mar 1969.
2. J.C. Chang, Distance-increasing mappings from binary vectors to permuations. IEEE Transactions on Information Theory, 51(1):359-363, Jan. 2005.
3. J.C. Chang, Distance-increasing mappings from binary vectors to permutations that increase Hamming distances by at least two. IEEE Transactions on Information Theory 52(4):1683-1689, Apr. 2006.
4. J.C. Chang, R.J. Chen, T. Kløve and S.C. Tsai, Distance-preserving mappings from binary vectors to permutations. IEEE Transactions on Information Theory 49(4):1054-1059, Apr. 2003.
5. P. Diaconis, Group Representations in Probability and Statistics, Institute of Mathematical Statistics, Hayward, California, 1988.
6. S. Haykin, Communication Systems, 4th Ed, John Wiley & Sons, Inc., USA.
7. Hendrik C. Ferreira, A.J. Han Vinck, Interference cancellation with permutation trellis codes. IEEE VTS-Fall VTC 2000 52(5):2401-2407, Sep. 2000.
8. M. Kendall and J. D. Gibbons, Rank correlation methods. London, U.K.: Edward Arnold, 1990.
9. K. Lee, New distance-preserving maps of odd length. IEEE Transactions on Information Theory 50(10):2539-2543, Oct. 2004.
10. K. Lee, Distance-increasing maps of all lengths by simple mapping algorithms. IEEE Transactions on Information Theory 52(7), 3344-3348, Jul. 2006.
11. J.H. van Lint, R.M. Wilson, A Course in Combinatiorics. Cambridge, U.K.: Cambridge Univ. Press, second edition, 2001.
12. T.G. Swart, H.C. Ferreira, A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings IEEE Transactions on Information Theory, 52(8), 3685-3695. Aug. 2006.
13. Shum, K.W., Permutation coding and MFSK modulation for frequency selective channel IEEE Personal, Indoor and Mobile Radio Communications 13(5):2063-2066, Sept. 2002.
14. E. Stoll and L. Kurz, Suboptimum Rank Detection Procedures Using Rank Vector Codes. Communications, IEEE Transactions 16(3), 402-410, Jun 1968.
15. A. J. H. Vinck and J. Häring, Coding and modulation for power-line communications, Proc. Int. Symp. Power Line Communication Limerick, Ireland, April, 2000.
16. A.J.H Vinck, J. Haering, T. Wadayama, Coded M-FSK for power line communications Information Theory, Proceedings. IEEE International Symposium on, 2000, p. 137.
17. A. J. H. Vinck, Coded modulation for powerline communications. Proc. Int. J. Electron. Commun, 54(1), 45-49, 2000.