Subspace codes and rank-metric codes: List-decoding and sparse constructions

Subspace codes and rank-metric codes are two closely related families of codes with a wide range of applications from storage systems to networks. In the first part of this talk, list decoding algorithms for algebraic subspace codes and rank-metric codes are discussed. These algorithms are based on multivariate interpolation in the ring of linearized polynomials and lead to significant improvements in error correction capability of these codes. In the second part, methods for constructing and decoding sparse rank-metric codes are presented. Such codes will allow efficient implementation and low complexity decoding algorithms.
Hessam Mahdavifar is an Assistant Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan. He received the B.Sc. degree from Sharif University of Technology, Tehran, Iran, in 2007, the M.Sc. and Ph.D. degrees from the University of California San Diego (UCSD), USA, in 2009, and 2012, respectively, all in Electrical Engineering. He was with the Samsung Mobile Solutions Lab between 2012 and 2016. Concurrently, he was with UCSD as Research Scholar and Lecturer. His general research interests are in coding and information theory with applications in wireless communications, security, data storage, and IoT. He has won several awards including the Best Paper Award in the 2015 IEEE International Conference on RFID, the UCSD Shannon Memorial Fellowship, and two Silver Medals at the International Mathematical Olympiad.