Permutation Arrays Under the Chebyshev Distance

@article{Klve2010PermutationAU,
  title={Permutation Arrays Under the Chebyshev Distance},
  author={Torleiv Kl\ove and Te-Tsung Lin and Shi-Chun Tsai and Wen-Guey Tzeng},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={2611-2617}
}
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. 

2 Figures & Tables

Topic

Statistics

01020302009201020112012201320142015201620172018
Citations per Year

128 Citations

Semantic Scholar estimates that this publication has 128 citations based on the available data.

See our FAQ for additional information.