Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
From MaRDI portal
Publication:5281432
DOI10.1109/TIT.2010.2046241zbMath1366.94672arXiv0907.3387WikidataQ59903027 ScholiaQ59903027MaRDI QIDQ5281432
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3387
Mathematical problems of computer architecture (68M07) Combinatorial codes (94B25) Modulation and demodulation in information and communication theory (94A14) Burst-correcting codes (94B20)
Related Items (12)
Increasing the minimum distance of codes by twisting ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ Computing the ball size of frequency permutations under Chebyshev distance ⋮ Constructions and invariants of optimal codes in the Lee metric ⋮ Coding for locality in reconstructing permutations ⋮ Lower bounds on the size of spheres of permutations under the Chebychev distance ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ Unnamed Item ⋮ 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 ⋮ Covering radius of permutation groups with infinity-norm ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
This page was built for publication: Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
