Permutation arrays under the Chebyshev distance

Torleiv Kløve*, Te Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng

*Corresponding author for this work

研究成果: Article同行評審

74 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號2046212
頁(從 - 到)2611-2617
頁數7
期刊IEEE Transactions on Information Theory
56
發行號6
DOIs
出版狀態Published - 1 六月 2010

指紋 深入研究「Permutation arrays under the Chebyshev distance」主題。共同形成了獨特的指紋。

引用此