On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
From MaRDI portal
Publication:522220
DOI10.1007/s10623-016-0239-yzbMath1364.68190OpenAlexW2463282950MaRDI QIDQ522220
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
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)
Related Items
Isomorphism of maximum length circuit codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
Cites Work
- Unnamed Item
- On the snake in the box problem
- Monotone Gray codes and the middle levels problem
- Snake-in-the-Box Codes for Rank Modulation Under Kendall’s $\tau $ -Metric
- Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
- Constructions of Snake-in-the-Box Codes for Rank Modulation
- Error-Correction in Flash Memories via Codes in the Ulam Metric
- Snake-in-the-Box Codes for Rank Modulation
- A Survey of Combinatorial Gray Codes
- Rank Modulation for Flash Memories
- Constant-Weight Gray Codes for Local Rank Modulation
- Codes in Permutations and Error Correction for Rank Modulation
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
- Permutation Arrays Under the Chebyshev Distance
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Generalized Gray Codes for Local Rank Modulation
