A Caltech Library Service

On the capacity of bounded rank modulation for flash memories

Wang, Zhiying and Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2009) On the capacity of bounded rank modulation for flash memories. California Institute of Technology , Pasadena, CA. (Unpublished)

PDF - Submitted Version
See Usage Policy.

PDF (Revised 4 May 2009; 26 June 2009) - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


Rank modulation has been recently introduced as a new information representation scheme for flash memories. Given the charge levels of a group of flash cells, sorting is used to induce a permutation, which in turn represents data. Motivated by the lower sorting complexity of smaller cell groups, we consider bounded rank modulation, where a sequence of permutations of given sizes are used to represent data. We study the capacity of bounded rank modulation under the condition that permutations can overlap for higher capacity.

Item Type:Report or Paper (Technical Report)
Bruck, Jehoshua0000-0001-8474-0812
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:2008.ETR091
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26122
Deposited By: Imported from CaltechPARADISE
Deposited On:10 May 2009
Last Modified:03 Oct 2019 03:11

Repository Staff Only: item control page