Title: Permutation Arrays Under the Chebyshev Distance
Authors: Klove, Torleiv
Lin, Te-Tsung
Tsai, Shi-Chun
Tzeng, Wen-Guey
資訊工程學系
Department of Computer Science
Keywords: Bounds;Chebyshev distance;code constructions;flash memory;permutation arrays
Issue Date: 1-Jun-2010
Abstract: 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.
URI: http://dx.doi.org/10.1109/TIT.2010.2046212
http://hdl.handle.net/11536/5300
ISSN: 0018-9448
DOI: 10.1109/TIT.2010.2046212
Journal: IEEE TRANSACTIONS ON INFORMATION THEORY
Volume: 56
Issue: 6
Begin Page: 2611
End Page: 2617
Appears in Collections:Articles


Files in This Item:

  1. 000277880200010.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.