En Gad, Eyal and Langberg, Michael and Schwartz, Moshe and Bruck, Jehoshua (2011) Generalized Gray Codes for Local Rank Modulation. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2011.ETR107
- Submitted Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2011.ETR107
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the code length, sliding window size, and overlap between adjacent windows. We show our constructed codes have asymptotically-optimal rate. We also provide efficient encoding, decoding, and next-state algorithms.
|Item Type:||Report or Paper (Technical Report)|
|Additional Information:||This work was supported in part by ISF grant 134/10, ISF grant 480/08, the Open University of Israel's research fund (grant no. 46114), the NSF grant ECCS-0802107, and an NSF-NRI award.|
|Group:||Parallel and Distributed Systems Group|
|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:||18 Feb 2011|
|Last Modified:||20 Jan 2016 00:27|
Repository Staff Only: item control page