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 October 2013 | Submitted
Journal Article 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 multilevel 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 that the presented codes have asymptotically optimal rate. We also provide efficient encoding, decoding, and next-state algorithms.

Additional Information

© 2013 IEEE. Manuscript received February 17, 2013; revised June 09, 2013; accepted June 11, 2013. Date of publication June 13, 2013; date of current version September 11, 2013. This work was supported in part by the ISF Grant 134/10, in part by the ISF Grant 480/08, in part by the Open University of Israel's Research Fund under Grant 46114, in part by the NSF under Grant ECCS-0802107, in part by the NSF under Grant CIF-1218005, in part by the United States–Israel Binational Science Foundation (BSF) under Grant 2010075, and in part by a gift from Northrop Grumman. The authors would like to thank the Associate Editor and the anonymous reviewers, whose comments helped improve the presentation of this paper.

Attached Files

Submitted - 1103.0317.pdf

Files

1103.0317.pdf
Files (127.4 kB)
Name Size Download all
md5:2d91176449e2c4ef9e8d5fa8fd0c734b
127.4 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 25, 2023