Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore fast list decoding algorithms for univariate multiplicity codes in this 31-minute conference talk by Mrinal Kumar from the ICTS Workshop on High Dimensional Expanders and Codes. Delve into advanced error-correcting code theory as Kumar presents techniques for efficiently decoding multiplicity codes, which are polynomial-based codes that evaluate polynomials and their derivatives at various points. Learn about the mathematical foundations underlying these decoding algorithms and their computational complexity advantages. Understand how multiplicity codes fit within the broader landscape of algebraic coding theory and their applications in reliable communication systems. Discover the intersection between high-dimensional expansion theory and error-correcting codes, two rapidly evolving fields in theoretical computer science and mathematics. The presentation forms part of a comprehensive workshop exploring recent breakthroughs in list-decodable codes, locally decodable codes, and quantum LDPC codes, bringing together researchers from mathematics, theoretical computer science, and electrical engineering to discuss cutting-edge developments in coding theory and high-dimensional expanders.
