Pages that link to "Item:Q5281383"
From MaRDI portal
The following pages link to Codes in Permutations and Error Correction for Rank Modulation (Q5281383):
Displaying 14 items.
- 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)
- Voting rules as error-correcting codes (Q899434) (← links)
- Restriction conditions on \(\mathrm{PL}(7, 2)\) codes \((3 \le \vert\mathcal{G}_i\vert \le 7)\) (Q1644866) (← links)
- Consolidation for compact constraints and Kendall tau LP decodable permutation codes (Q1675286) (← links)
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric (Q2234465) (← links)
- On maximum Lee distance codes (Q2249930) (← links)
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation (Q2302152) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric (Q6086190) (← links)