Tata Institute of Fundamental Research
Unbounded error correcting codes
STCS Student Seminar
Speaker:
Eeshan Modak (TIFR)
Organiser:
Ratnakar Medepalli
Date:
Friday, 29 Nov 2024, 16:00 to 17:00
Venue:
A-201 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
Efremenko and Zamir introduce a variant of error correcting codes (ECC) with no predetermined length. An unbounded ECC with rate R and distance ε is an encoding of a (possibly infinite) message into a (possibly infinite) codeword, such that for every large enough k we may recover the first Rk symbols of the message from the first k symbols of the codeword. In this talk, we study the performance of linear codes in the unbounded setting.
This talk is based on this recent paper: https://arxiv.org/abs/2411.04803
| Speaker: | Eeshan Modak (TIFR) |
| Organiser: | Ratnakar Medepalli |
| Date: | Friday, 29 Nov 2024, 16:00 to 17:00 |
| Venue: | A-201 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
Efremenko and Zamir introduce a variant of error correcting codes (ECC) with no predetermined length. An unbounded ECC with rate R and distance ε is an encoding of a (possibly infinite) message into a (possibly infinite) codeword, such that for every large enough k we may recover the first Rk symbols of the message from the first k symbols of the codeword. In this talk, we study the performance of linear codes in the unbounded setting.
This talk is based on this recent paper: https://arxiv.org/abs/2411.04803