Permutation Arrays Under the Chebyshev Distance

檔案

日期

2010-06-01

期刊名稱

IEEE TRANSACTIONS ON INFORMATION THEORY

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料