Title: Efficient Encoding and Decoding with Permutation Arrays
Authors: Lin, Te-Tsung
Tsai, Shi-Chun
Tzeng, Wen-Guey
資訊工程學系
Department of Computer Science
Issue Date: 2008
Abstract: An (n, d) permutation array (PA) is a subset of S(n) 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(infinity)-norm to measure the distance between permutations, and give a construction of permutation arrays under l(infinity)-norm together with efficient encoding and decoding algorithms. This construction is the first of its kind.
URI: http://hdl.handle.net/11536/32087
ISBN: 978-1-4244-2256-2
Journal: 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6
Begin Page: 211
End Page: 214
Appears in Collections:Conferences Paper