Title :
Permutation Arrays Under the Chebyshev Distance
Author :
Kløve, Torleiv ; Lin, Te-Tsung ; Tsai, Shi-Chun ; Tzeng, Wen-Guey
Author_Institution :
Dept. of Inf., Univ. of Bergen, Bergen, Norway
fDate :
6/1/2010 12:00:00 AM
Abstract :
An (n,d) permutation array (PA) is a subset of Sn 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.
Keywords :
flash memories; Chebyshev distance; Chebyshev metric; flash memories; permutation arrays; power line communication; AWGN; Additive white noise; Chebyshev approximation; Decoding; Error correction; Flash memory; Gaussian noise; Hamming distance; Noise level; Pulse modulation; Bounds; Chebyshev distance; code constructions; flash memory; permutation arrays;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2010.2046212
