On the snake-in-the-box codes for rank modulation under Kendall's -metric
DOI10.1007/S10623-016-0239-YzbMATH Open1364.68190OpenAlexW2463282950MaRDI QIDQ522220FDOQ522220
Publication date: 13 April 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0239-y
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25) Modulation and demodulation in information and communication theory (94A14)
Cites Work
- A Survey of Combinatorial Gray Codes
- Monotone Gray codes and the middle levels problem
- Rank Modulation for Flash Memories
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
- Permutation Arrays Under the Chebyshev Distance
- Snake-in-the-Box Codes for Rank Modulation
- Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
- Error-Correction in Flash Memories via Codes in the Ulam Metric
- Title not available (Why is that?)
- Codes in Permutations and Error Correction for Rank Modulation
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- On the snake in the box problem
- Snake-in-the-Box Codes for Rank Modulation Under Kendall’s $\tau $ -Metric
- Constructions of Snake-in-the-Box Codes for Rank Modulation
- Constant-Weight Gray Codes for Local Rank Modulation
- Generalized Gray Codes for Local Rank Modulation
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
- Title not available (Why is that?)
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)
