Permutation Arrays Under the Chebyshev Distance

DOI10.1109/TIT.2010.2046212zbMATH Open1366.94761arXiv0907.2682MaRDI QIDQ5281440FDOQ5281440

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

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0907.2682

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

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25) Bounds on codes (94B65)

Cited In (17)

• Multiple ellipse fitting of densely connected contours
• Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
• Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
• Computing the ball size of frequency permutations under Chebyshev distance
• Title not available (Why is that?)
• Title not available (Why is that?)
• Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
• Covering radius of permutation groups with infinity-norm
• Title not available (Why is that?)
• Lower bounds on the size of spheres of permutations under the Chebychev distance
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Metrics on permutations with the same peak set
• Decoding permutation arrays with ternary vectors
• Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• New nonexistence results on perfect permutation codes under the Hamming metric
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric

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)