The Geometry of List-Decoding Projective Space Codes
Talk by Dr. Kyle Marshall
Date: 16.12.13 Time: 13.00 - 14.00 Room:
Projective space codes have received an increasing amount of attention since they were shown to be applicable for error correction in the Network setting on Koetter and Kschichang. Since then, many optimally efficient codes have been discovered, some with good decoding algorithms. As in the case of classical coding theory, we can also ask if it is possible to have a list-decoding algorithm. For the most widely studied classes of codes, none so far exists. The problem of list decoding projective space codes was shown to be a problem of intersecting Schubert varieties with varieties defining the code. We examine this more closely and obtain a upper bound for list-decodability for lifted rank-metric codes.