eSeminar: On cutting blocking sets and their codes

Vortrag von Dr. Francesco Pavese

Datum: 02.12.20  Zeit: 15.00 - 16.00  Raum:

<a href="https://uzh.mediaspace.cast.switch.ch/media/Francesco%20Pavese%3A%20On%20cutting%20blocking%20sets%20and%20their%20codes/0_97m02jnr/11634" target="_blank"><button>Video<i class="fa fa-play-circle"></i></button></a> <a href="https://www.math.uzh.ch/aa/uploads/media/FP_Zurich2020.pdf" target="_blank"><button>Slides<i class="fa fa-play-circle"></i></button></a><br><br> (**This eSeminar will take place on Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact karan.khathuria@math.uzh.ch **) <BR> <BR> Let PG(r, q) be the r-dimensional projective space over the finite field GF(q). A set &Chi; of points of PG(r, q) is a cutting blocking set if for each hyperplane &Pi; of PG(r, q) the set &Pi; &cap; &Chi; spans &Pi;. Cutting blocking sets give rise to saturating sets and minimal linear codes. Of particular interest are those having a size as small as possible. In this talk, I will discuss known constructions of cutting blocking sets, from which there arise minimal linear codes whose length grows linearly with respect to their dimension. I will also present two new constructions of cutting blocking sets whose sizes are smaller than the known ones.