Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 18, 2011 | Submitted
Report Open

Generalized Gray Codes for Local Rank Modulation

Abstract

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.

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.

Attached Files

Submitted - etr107.pdf

Files

etr107.pdf
Files (107.3 kB)
Name Size Download all
md5:bc523376cd22f6148f7d030769703338
107.3 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023