Systematic Error-Correcting Codes for Rank Modulation

DOI10.1109/TIT.2014.2365499MaRDI QIDQ2978800zbMATH OpenOpenAlexWikidataFDO

Authors Hongchao Zhou, Moshe Schwartz, Anxiao (Andrew) Jiang, Jehoshua Bruck

Publication date 28 April 2017

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

Full work available at URL https://arxiv.org/abs/1310.6817

Mathematics Subject Classification ID

Burst-correcting codes (94B20) Synchronization error-correcting codes (94B50) Modulation and demodulation in information and communication theory (94A14)

Abstract: The rank-modulation scheme has been recently proposed for efficiently storing data in nonvolatile memories. Error-correcting codes are essential for rank modulation, however, existing results have been limited. In this work we explore a new approach, emph{systematic error-correcting codes for rank modulation}. Systematic codes have the benefits of enabling efficient information retrieval and potentially supporting more efficient encoding and decoding procedures. We study systematic codes for rank modulation under Kendall's $au$-metric as well as under the $el{l}_{i}nfty$-metric. In Kendall's $au$-metric we present $[k+2,k,3]$-systematic codes for correcting one error, which have optimal rates, unless systematic perfect codes exist. We also study the design of multi-error-correcting codes, and provide two explicit constructions, one resulting in $[n+1,k+1,2t+2]$ systematic codes with redundancy at most $2t+1$. We use non-constructive arguments to show the existence of $[n,k,n-k]$-systematic codes for general parameters. Furthermore, we prove that for rank modulation, systematic codes achieve the same capacity as general error-correcting codes. Finally, in the $el{l}_{i}nfty$-metric we construct two $[n,k,d]$ systematic multi-error-correcting codes, the first for the case of $d=O(1)$, and the second for $d=Theta(n)$. In the latter case, the codes have the same asymptotic rate as the best codes currently known in this metric.

Cited in

(7)

• Rate-improved multi-permutation codes for correcting a single burst of stable deletions
• Rank error-correcting pairs
• Maximum-rank array codes and their application to crisscross error correction
• Minkowski \(\mathrm{t}\)-graph and Kendall \(\tau\)-graph of the symmetric group
• Systematic Block Markov Superposition Transmission of Repetition Codes
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes

This page was built for publication: Systematic Error-Correcting Codes for Rank Modulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978800)