Correcting Charge-Constrained Errors in the Rank-Modulation Scheme

DOI10.1109/TIT.2010.2043764zbMATH Open1366.94767DBLPjournals/tit/JiangSB10OpenAlexW2144030381WikidataQ59903015 ScholiaQ59903015MaRDI QIDQ5281483FDOQ5281483

Authors: Anxiao (Andrew) Jiang, Moshe Schwartz, Jehoshua Bruck 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2043764

Mathematics Subject Classification ID

Bounds on codes (94B65) Error probability in coding theory (94B70) Modulation and demodulation in information and communication theory (94A14)

Cited In (12)

• Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
• Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
• Reconstruction of permutations distorted by single Kendall \(\tau\)-errors
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
• Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
• On linear diameter perfect Lee codes with distance 6
• New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• New nonexistence results on perfect permutation codes under the Hamming metric
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-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)