Permutation Arrays Under the Chebyshev Distance

DOI10.1109/TIT.2010.2046212zbMath1366.94761arXiv0907.2682MaRDI QIDQ5281440

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

Publication date: 27 July 2017

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

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

Mathematics Subject Classification ID

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

Related Items (14)

New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Approximate sorting and its applications in I/O model ⋮ Computing the ball size of frequency permutations under Chebyshev distance ⋮ Lower bounds on the size of spheres of permutations under the Chebychev distance ⋮ Decoding permutation arrays with ternary vectors ⋮ Unnamed Item ⋮ Multiple ellipse fitting of densely connected contours ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ 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 ⋮ Covering radius of permutation groups with infinity-norm ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation

This page was built for publication: Permutation Arrays Under the Chebyshev Distance