I work on error-correcting coding theory (coding theory, for short), a sub-field of information theory. Coding theory intersects mathematics and engineering, with applications to many areas of communication such as satellite and cellular phone transmission, data storage, etc. The main challenge in coding theory is to find codes having the largest number of words and error-correcting capabilities for optimum communication efficiency. Constructing such optimal codes is still an open problem. In practice, one or two parameters are fixed in order to find codes having the best possible value for the other(s) parameter(s).
I develop techniques to design and construct codes whose parameters satisfy specific coding and error correcting needs. Specifically, development of techniques for computing bounds for the minimum distance of algebraic codes as well as for designing and constructing codes with certain parameters. All this from the study of the current bounds and the analysis of their construction, based on algebraic coding theory and techniques I developed. I am also interested in the study of classic codes such as Reed-Solomon, Goppa, etc. with the aim of extending them to multiple variables.
My work involves studying the properties of codes and their fitness for specific applications, including data compression, cryptography, error-correction and network coding.
Currently Funded Research
Group rings, partial actions and algebraic methods in error correcting codes and symbolic dynamics. Funded by the Spanish Ministry of Economics and Competitiveness under grant MTM2012-35240.