Bounds on the asymptotic rate of block codes

Vortrag von Danai Hansmann

Datum: 31.05.23  Zeit: 15.00 - 16.00  Raum: Y27H25

In this talk, we investigate the behavior of families of codes and study their asymptotic rate and relative distance. A function representing the best achievable information rate for a fixed relative distance is defined and shown to be continuous. Determining the exact values of this function is considered very difficult and remains an open problem. Consequently, various upper bounds will be presented and compared. We will also present a construction of a new upper bound.

(**This eSeminar will take place over Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact zita.fiquelideabreu@math.uzh.ch **)