Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
From MaRDI portal
Cited in
(18)- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- 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
- On linear diameter perfect Lee codes with distance 6
- New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric
- Reconstruction of permutations distorted by single Kendall -errors
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
- On lattice constructions D and D^ from q-ary linear codes
- Bounds for permutation arrays under Kendall tau metric
- Upper bounds on the size of permutation codes with a Hamming distance of five
- Rate-improved multi-permutation codes for correcting a single burst of stable deletions
- Minkowski \(\mathrm{t}\)-graph and Kendall \(\tau\)-graph of the symmetric group
- MWS and FWS codes for coordinate-wise weight functions
- Constructing permutation codes under the generalized Kendall- metric
This page was built for publication: Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281483)
