ACCESS
Algebraic Coding and Cryptography
Seminar Series
Online Event
ACCESS is a joint effort designed to highlight world-class research in coding theory, cryptography, and related areas and to encourage collaboration among its participants.
Next seminar
Mar 04
Mar 04
Delio Jaramillo Velez
Chalmers University of Technology
Chalmers University of Technology
Edge codes associated with hypergraphs
Abstract. Graph theory and error-correcting codes have many connections, from the definition of hypergraph codes to the use of graph connectivity in computing minimum distance. In this talk, I will present one more connection by introducing and studying a specific family of evaluation codes known as edge codes. The focus will be on their fundamental parameters, particularly their minimum distance. I will present estimates for the minimum distance in the case of d-uniform clutters and discuss the computation of Next-to-Minimal Weights for edge codes associated with connected trees.
Biography. I am currently a postdoctoral researcher at Chalmers University of Technology, Sweden. Previously, I completed my PhD at Cinvestav, Mexico, under the supervision of Rafael H. Villarreal. My research interests include contribution scoring in privacy-preserving machine learning, algebraic coding theory and quantum codes, as well as combinatorial commutative algebra. In my free time, I enjoy spending time at the gym and dancing.