Constant-Weight 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 constant-weight Gray codes for the local rank- modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. We provide necessary conditions for the existence of cyclic and cyclic optimal Gray codes. We then specifically study codes of weight 2 and upper bound their efficiency, thus proving that there are no such asymptotically-optimal cyclic codes. In contrast, we study codes of weight 3 and efficiently construct codes which are asymptotically-optimal. We conclude with a construction of codes with asymptotically-optimal rate and weight asymptotically half the length, thus having an asymptotically-optimal charge difference between adjacent cells.
Additional Information
The material in this paper was presented in part at the IEEE International Symposium on Information Theory (ISIT 2010), Austin, TX, U.S.A., June 2010, and at the 26-th IEEE Convention of Electrical ans Electronics Engineers in Israel (IEEEI 2010), Eilat, Israel, November 2010. 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.Files
| Name | Size | Download all |
|---|---|---|
|
md5:caf046df46c89c7239314f6c24941ea2
|
210.6 kB | Preview Download |
Additional details
- Eprint ID
- 26136
- Resolver ID
- CaltechPARADISE:2010.ETR105
- Created
-
2011-01-04Created from EPrint's datestamp field
- Updated
-
2021-08-18Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group