Efficient encoding and decoding with permutation arrays

Te Tsung Lin*, Shi-Chun Tsai, Wen-Guey Tzeng

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

An (n, d) permutation array (PA) is a subset of Sn with the property that the distance (under any distance metric, such as Hamming) between any two permutations in the array is at least d, which becomes popular recently for communication over power line. We use l∞-norm to measure the distance between permutations, and give a construction of permutation arrays under l∞-norm together with efficient encoding and decoding algorithms. This construction is the first of its kind.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages211-214
Number of pages4
DOIs
StatePublished - 29 Sep 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: 6 Jul 200811 Jul 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period6/07/0811/07/08

Fingerprint Dive into the research topics of 'Efficient encoding and decoding with permutation arrays'. Together they form a unique fingerprint.

  • Cite this

    Lin, T. T., Tsai, S-C., & Tzeng, W-G. (2008). Efficient encoding and decoding with permutation arrays. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 211-214). [4594978] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4594978