On the snake-in-the-box codes for rank modulation under Kendall's -metric
From MaRDI portal
(Redirected from Publication:522220)
On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
Recommendations
- Snake-in-the-Box Codes for Rank Modulation Under Kendall’s $\tau $ -Metric
- Snake-in-the-Box Codes for Rank Modulation under Kendall’s <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math> </inline-formula>-Metric in <inline-formula> <tex-math notation="LaTeX">$S_{2n+2}$ </tex-ma
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- Constructions of Snake-in-the-Box Codes for Rank Modulation
- Snake-in-the-Box Codes for Rank Modulation
- Perfect Snake-in-the-Box Codes for Rank Modulation
- A new non-asymptotic upper bound for snake-in-the-box codes
- scientific article; zbMATH DE number 2154135
- A new lower bound for snake-in-the-box codes
- scientific article; zbMATH DE number 1498820
Cites work
- A Survey of Combinatorial Gray Codes
- Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
- Codes in Permutations and Error Correction for Rank Modulation
- Constant-Weight Gray Codes for Local Rank Modulation
- Constructions of Snake-in-the-Box Codes for Rank Modulation
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
- Error-Correction in Flash Memories via Codes in the Ulam Metric
- Generalized Gray Codes for Local Rank Modulation
- Metrics on permutations, a survey
- Monotone Gray codes and the middle levels problem
- On the snake in the box problem
- Permutation Arrays Under the Chebyshev Distance
- Rank Modulation for Flash Memories
- Snake-in-the-Box Codes for Rank Modulation
- Snake-in-the-Box Codes for Rank Modulation Under Kendall’s $\tau $ -Metric
Cited in
(9)- Isomorphism of maximum length circuit codes
- Snake-in-the-Box Codes for Rank Modulation
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- A new non-asymptotic upper bound for snake-in-the-box codes
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
- A new lower bound for snake-in-the-box codes
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- New nonexistence results on perfect permutation codes under the Hamming metric
- scientific article; zbMATH DE number 2154135 (Why is no real title available?)
This page was built for publication: On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522220)
