Zhou, Hongchao and Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2011) Systematic Error-Correcting Codes for Rank Modulation. , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2011.ETR112
- Submitted Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2011.ETR112
The rank modulation scheme has been proposed recently for efficiently writing and storing data in nonvolatile memories. Error-correcting codes are very important for rank modulation; however, existing results have bee limited. In this work, we explore a new approach, 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 equipped with the Kendall’s τ-distance. We present (k + 2, k) systematic codes for correcting one error, which have optimal rates unless perfect codes exist. We also study the design of multi-error-correcting codes, and prove that for any 2 ≤ k < n, there always exists an (n,k) systematic code of minimum distance n − k. Furthermore, we prove that for rank modulation, systematic codes achieve the same capacity as general error-correcting codes.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Parallel and Distributed Systems Group|
|Other Numbering System:|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechPARADISE|
|Deposited On:||14 Jul 2011|
|Last Modified:||19 Jan 2016 23:51|
Repository Staff Only: item control page