Browsing by Author "Lin, Te-Tsung"

Now showing 1 - 4 of 4

Decoding permutation arrays with ternary vectors
(2011-10-01)
Lee, Chia-Jung
;
Lin, Te-Tsung
;
Shieh, Min-Zheng
;
Tsai, Shi-Chun
;
Wu, Hsin-Lung
We give an explicit decoding scheme for the permutation arrays under Hamming distance metric, where the encoding is constructed via a distance-preserving mapping from ternary vectors to permutations (3-DPM).
Efficient Encoding and Decoding with Permutation Arrays
(2008)
Lin, Te-Tsung
;
Tsai, Shi-Chun
;
Tzeng, Wen-Guey
;
資訊工程學系
;
Department of Computer Science
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.
Permutation Arrays Under the Chebyshev Distance
(2010-06-01)
Klove, Torleiv
;
Lin, Te-Tsung
;
Tsai, Shi-Chun
;
Tzeng, Wen-Guey
;
資訊工程學系
An (n, d) permutation array (PA) is a subset of S(n) with the property that the distance (under some metric) between any two permutations in the array is at least d. They became popular recently for communication over power lines. Motivated by an application to flash memories, in this paper, the metric used is the Chebyshev metric. A number of different constructions are given, as well as bounds on the size of such PA.
Simple distance-preserving mappings from ternary vectors to permutations
(2008-07-01)
Lin, Te-Tsung
;
Tsai, Shi-Chum
;
Wu, Hsin-Lung
;
資訊工程學系
;
Department of Computer Science
We give a simple construction of distance-preserving Mappings from ternary vectors to permutations (3-DPM). Our result gives a lower bound for permutation arrays, i.e., P(n, d) >= A(3)(n, d), which significantly improves previous lower bounds for d <= 3n/5.