| week selector | S | M | T | W | T | F | S |
|---|---|---|---|---|---|---|---|
go to week of May 26, 2013![]() | 26 | 27 | 28 | 29 | 30 | 31 | 1 |
![]() | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
go to week of Jun 9, 2013![]() | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
go to week of Jun 16, 2013![]() | 16 | 17 | 18 | 19 | 20 | 21 | 22 |
![]() | 23 | 24 | 25 | 26 | 27 | 28 | 29 |
![]() | 30 | 1 | 2 | 3 | 4 | 5 | 6 |
CSL Women in Engineering Seminar
Title: Rank Modulation Codes for Flash Memories
Speaker: Farzad Farnoud (Hassanzadeh)
Ph.D. Candidate in Electrical & Computer Eng.
University of Illinois
Date: Wednesday, May 2, 2012
Time: 4:00 p.m.
Location: B-02 Coordinated Science Lab
Abstract: We consider a generalization of rank modulation coding for flash memories that allows for handling arbitrary charge drop errors. Unlike rank modulation codes that may be used for correcting errors that manifest themselves as swaps of two adjacently ranked elements, the proposed translocation rank codes account for more general forms of errors that arise in storage systems. Translocations represent a natural extension of the notion of adjacent transposition and as such may be analyzed using related concepts in combinatorics and rank modulation coding.
Our results include tight bounds on the capacity of translocation rank codes, construction techniques for asymptotically good codes, as well as simple decoding methods for the proposed structured code families. The codes also present the first known class of multiple deletion/insertion error-correcting codes over permutations.
Biography: Farzad Farnoud (Hassanzadeh) received his BSc degree in Electrical Engineering from Sharif University of Technology, Iran, on August 2006. He received his MSc degree in Electrical and Computer Engineering from University of Toronto, Canada. He is currently a PhD candidate in Electrical and Computer Engineering at UIUC. His research interests include broadcasting problems in vehicular environments, distribution estimation in the presence of errors, rank modulation for flash memories and rank aggregation algorithms.