Permutation Arrays Under the Chebyshev Distance
From MaRDI portal
Abstract: An (n,d) permutation array (PA) is a set of permutations of length 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.
Recommendations
- scientific article; zbMATH DE number 874517
- Computing the ball size of frequency permutations under Chebyshev distance
- Decoding Frequency Permutation Arrays Under Chebyshev Distance
- Permutation Methods
- Permutation methods. A distance function approach
- scientific article; zbMATH DE number 4177065
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- scientific article; zbMATH DE number 3999944
- On the distance between the expressions of a permutation
- scientific article; zbMATH DE number 125593
Cited in
(21)- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Multiple ellipse fitting of densely connected contours
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Covering radius of permutation groups with infinity-norm
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- scientific article; zbMATH DE number 4177065 (Why is no real title available?)
- Computing the ball size of frequency permutations under Chebyshev distance
- scientific article; zbMATH DE number 3999944 (Why is no real title available?)
- Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- New nonexistence results on perfect permutation codes under the Hamming metric
- scientific article; zbMATH DE number 7790332 (Why is no real title available?)
- Decoding permutation arrays with ternary vectors
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
- Metrics on permutations with the same peak set
- Metrics on permutations with the same descent set
- Bounds for permutation arrays under Kendall tau metric
- Exploring the influence of normalization on classification accuracy in solving Helen's dating problem based on KNN algorithm
- Rank-modulation codes for DNA storage in shotgun sequencing: structure and distance properties
This page was built for publication: Permutation Arrays Under the Chebyshev Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281440)
