Permutation arrays under the Chebyshev distance

Authors:
Torleiv Kløve;Te-Tsung Lin;Shi-Chun Tsai;Wen-Guey Tzeng
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 3
Cited 4

Enumerative combinatorics

Enumerative combinatorics
Flash Memories

Flash Memories
Communication Systems

Communication Systems

Decoding frequency permutation arrays under Chebyshev distance

IEEE Transactions on Information Theory
Lower bounds on the size of spheres of permutations under the Chebychev distance

Designs, Codes and Cryptography
Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices

Journal of Combinatorial Theory Series A
Decoding permutation arrays with ternary vectors

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.90

Visualization

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.