Speaker
Rodrigo San-José
(Virginia Tech)
Description
The relative generalized Hamming weights of a nested pair of linear codes are a generalization of the minimum distance. We will see how these parameters characterize the security of ramp secret sharing schemes, and how this can be adapted for private information retrieval. The computation of these parameters for a linear code is NP-hard in general, and we will study the most efficient current algorithm to compute them for any nested pair of linear codes.
Some of these results are joint work with Diego Ruano and Gonzalo Rodríguez-Pajares.
Author
Rodrigo San-José
(Virginia Tech)
Co-authors
Prof.
Diego Ruano
(University of Valladolid)
Mr
Gonzalo Rodríguez-Pajares
(University of Valladolid)