
Generalized Reed Solomon Codes by Brenda Jaroker '25 & Alexa Cerda '25
Wed, October 23rd, 2024
1:00 pm - 1:50 pm
- This event has passed.

Generalized Reed Solomon Codes by Brenda Jaroker ’25 & Alexa Cerda ’25, Wednesday October 23, 1:00 – 1:50pm, North Science Building 113, Wachenheim, Mathematics Seminar
Abstract: This talk presents an analysis of generalized Reed-Solomon codes, demonstrating their maximum distance separable (MDS) property and their effectiveness in error correction. We will explore the underlying algebraic structure that allows these codes to achieve optimal error correction capabilities while maintaining robustness against data loss. By providing a clear framework for understanding the relationship between code parameters and their performance, this presentation will highlight the significance of generalized Reed-Solomon codes in modern coding theory and their applications in reliable data transmission.
Event/Announcement Navigation
- « Kif-Kif Bledi Performance – North African and Fusion Dance
- Come chat about the new WCMA building! »