Codes in permutations and error correction for rank modulation

Jump to other IT Society Websites:

Codes in permutations and error correction for rank modulation


Creation Date: Jun 13, 2010

Published In: Jun 2010

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Austin, TX, USA


Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representing them as subsets of the set of permutations of n elements equipped with the Kendall tau distance. We derive several lower and upper bounds on the size of codes. These bounds enable us to establish the exact scaling of the size of optimal codes for large values of n. We also show the existence of codeswhose size is within a constant factor of the sphere packing bound for any fixed number of errors.

IEEE Explore link:

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:


Table of Contents

IEEE TechNav