标题: Permutation Arrays Under the Chebyshev Distance
作者: Klove, Torleiv
Lin, Te-Tsung
Tsai, Shi-Chun
Tzeng, Wen-Guey
资讯工程学系
Department of Computer Science
关键字: Bounds;Chebyshev distance;code constructions;flash memory;permutation arrays
公开日期: 1-六月-2010
摘要: 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
期刊: IEEE TRANSACTIONS ON INFORMATION THEORY
Volume: 56
Issue: 6
起始页: 2611
结束页: 2617
显示于类别:Articles


文件中的档案:

  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.