Permutation Arrays Under the Chebyshev Distance

Permutation Arrays Under the Chebyshev Distance

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 me...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2010-06, Vol.56 (6), p.2611-2617
Hauptverfasser: Klve, Torleiv, Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng
Format: Artikel
Sprache:eng
Schlagworte:
Additive white noise
Arrays
AWGN
Bounds
Chebyshev approximation
Chebyshev distance
code constructions
Construction
Decoding
Error correction
Flash memory
Flash memory (computers)
Gaussian noise
Hamming distance
Information science
Information systems
Information theory
Mathematics
Noise level
permutation arrays
Permutations
Power lines
Pulse modulation
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2046212