• Calendar

January 24, Tuesday
12:00 – 14:00

Storage applications may be revolutionized in the near future by new technologies, such as band recording, page-oriented optical memory, and volume holographic storage. However, all of these require efficient two-dimensional error-correcting codes capable of correcting bursts of errors.

In this talk we will survey the latest results in two-dimensional burst-correcting coding theory. These results use two different approaches to the problem. The first employs interleaving schemes, and to that end, we will generalize the notion of the distance of two points in the plane, to a quantity that reflects the relative dispersion of three (or more) points. In the context of interleaving schemes we will show codes, and their less-known counterpart, anticodes (which also have interesting applications in the game of Go, or multicasting in multi-processor networks), as well as lattice-based interleavers. The second is a direct algebraic approach, in which we will show the first ever constructions for such codes, and bounds on their efficiency.

The presentation is for a general audience. No prior knowledge is needed.

The talk is based on some recent works with Tuvi Etzion (Technion) and Alexander Vardy (UCSD).

Moshe Schwartz was born in Israel in 1975. He received the B.A., M.Sc.,and Ph.D. degrees from the Technion – Israel Institute of Technology, Haifa, Israel, in 1997, 1998, and 2004 respectively, all from the Computer Science Department.

He was a Fulbright post-doctoral researcher in the Department of Electrical and Computer Engineering, University of California San Diego, USA, and is now a post-doctoral researcher in the Department of Electrical Engineering, California Institute of Technology. His research interests include coding theory (both algebraic and combinatorial), constrained coding, network coding, digital sequences, and combinatorial structures.