On the Capacity of Bounded Rank Modulation for Flash Memories Conference Paper uri icon

abstract

  • 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. 2009 IEEE.

name of conference

  • 2009 IEEE International Symposium on Information Theory

published proceedings

  • 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4

author list (cited authors)

  • Wang, Z., Jiang, A. A., & Bruck, J.

citation count

  • 17

complete list of authors

  • Wang, Zhiying||Jiang, Anxiao Andrew||Bruck, Jehoshua

publication date

  • June 2009