Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore recent advances in list-size bounds for Folded Reed-Solomon (FRS) codes in this 49-minute conference talk delivered at the ICTS Workshop on High Dimensional Expanders and Codes. Delve into the latest theoretical developments that improve our understanding of list-decoding capabilities for these important error-correcting codes. Learn about the mathematical techniques and proof strategies used to establish tighter bounds on list sizes, which have significant implications for coding theory and its applications in communication systems. Discover how these improvements contribute to the broader landscape of error-correcting codes research and their connections to high dimensional expanders. The presentation provides insights into cutting-edge research at the intersection of combinatorics, algebra, and theoretical computer science, offering valuable perspectives for researchers working in coding theory, complexity theory, and related mathematical fields.
