Explicit List-Decodable Subspace Codes with High Rate
, Carnegie Mellon University (CMU)
Date: Wednesday, April 09, 2014
Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone
Host: Ilya Razenshteyn, MIT/CSAIL
Contact: Rebecca Yadegar, (617)253-6025, email@example.com
Relevant URL: https://calendar.csail.mit.edu/seminar_series/6787
Speaker URL: None
TALK: Algorithms & Complexity Seminar: Carol Wang
Abstract: This talk will describe some recent work on subspace codes, which were introduced in the context of network coding. Subspace codes allow information to be transmitted over an unknown network even in the presence of errors. In this talk, we give the first explicit construction of list-decodable subspace codes which achieve optimal redundancy.
Our codes are subcodes of Koetter-Kschischang codes, the analogue of Reed-Solomon codes for subspace coding. The construction relies on designing a special class of "subspace designs" suitable for use over large fields. Our techniques also imply the first explicit high-rate list-decodable codes for the rank metric.
Joint work with Venkat Guruswami.
Created by Rebecca Yadegar at Thursday, April 03, 2014 at 3:42 PM.