Pages that link to "Item:Q5281440"
From MaRDI portal
The following pages link to Permutation Arrays Under the Chebyshev Distance (Q5281440):
Displaying 15 items.
- Computing the ball size of frequency permutations under Chebyshev distance (Q417597) (← links)
- Proof of a conjecture of Kløve on permutation codes under the Chebychev distance (Q521871) (← links)
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric (Q522220) (← links)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
- Decoding permutation arrays with ternary vectors (Q634128) (← links)
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
- Multiple ellipse fitting of densely connected contours (Q2224874) (← links)
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric (Q2234465) (← links)
- Covering radius of permutation groups with infinity-norm (Q2297719) (← links)
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation (Q2302152) (← links)
- Lower bounds on the size of spheres of permutations under the Chebychev distance (Q2430688) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- Approximate sorting and its applications in I/O model (Q6122589) (← links)
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric (Q6489327) (← links)
- Metrics on permutations with the same peak set (Q6650625) (← links)
