Compressed Encoding for Rank Modulation

Details Compressed Encoding for Rank Modulation Compressed Encoding for Rank Modulation

2011-08-13

arxiv.org/abs/1108.2741v1

Computer Science

Information Theory

Scientific paper

Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the "push to the top" operation that is not efficient in the general case. We propose a new encoding procedure where a cell level is raised to be higher than the minimal necessary subset - instead of all - of the other cell levels. This new procedure leads to a significantly more compressed (lower charge levels) encoding. We derive an upper bound for a family of codes that utilize the proposed encoding procedure, and consider code constructions that achieve that bound for several special cases.

Affiliated with

Also associated with

No associations

Rating

Compressed Encoding for Rank Modulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressed Encoding for Rank Modulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed Encoding for Rank Modulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635808