TY - GEN
T1 - Efficient encoding and decoding with permutation arrays
AU - Lin, Te Tsung
AU - Tsai, Shi-Chun
AU - Tzeng, Wen-Guey
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=52349122018&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4594978
DO - 10.1109/ISIT.2008.4594978
M3 - Conference contribution
AN - SCOPUS:52349122018
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 211
EP - 214
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -