Proximity Gaps for Reed-Solomon Codes
APA
(2025). Proximity Gaps for Reed-Solomon Codes. SciVideos. https://youtube.com/live/8gE2TzHzsfQ
MLA
Proximity Gaps for Reed-Solomon Codes. SciVideos, May. 05, 2025, https://youtube.com/live/8gE2TzHzsfQ
BibTex
@misc{ scivideos_ICTS:31734, doi = {}, url = {https://youtube.com/live/8gE2TzHzsfQ}, author = {}, keywords = {}, language = {en}, title = {Proximity Gaps for Reed-Solomon Codes}, publisher = {}, year = {2025}, month = {may}, note = {ICTS:31734 see, \url{https://scivideos.org/icts-tifr/31734}} }
Shubhangi Saraf
Talk numberICTS:31734
Source RepositoryICTS-TIFR
Abstract
I will talk about proximity gaps for Reed-Solomon codes. In particular we will discuss questions of the following kind: How many points of an affine space can be "close" in Hamming distance to the Reed-Solomon code?
We will see how to use an understanding of this, to effectively analyze interactive protocols for testing if a given function is close to a Reed-Solomon Codeword.