Permutation arrays under the Chebyshev distance

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

*Corresponding author for this work

Research output: Contribution to journalArticle

75 Scopus citations

Abstract

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.

Original languageEnglish
Article number2046212
Pages (from-to)2611-2617
Number of pages7
JournalIEEE Transactions on Information Theory
Volume56
Issue number6
DOIs
StatePublished - 1 Jun 2010

Keywords

  • Bounds
  • Chebyshev distance
  • Code constructions
  • Flash memory
  • Permutation arrays

Fingerprint Dive into the research topics of 'Permutation arrays under the Chebyshev distance'. Together they form a unique fingerprint.

Cite this