Registration is closed for the event requested
(Sum-)rank metric codes and skew polynomials (II)
rank metric codes and skew polynomials (II)
rank metric codes and skew polynomials (II)
This talk is a continuation of the previous one. We present an overview of the algebraic foundations underlying rank-metric and sum-rank metric codes and explain how skew polynomial rings provide a unifying language for their construction and analysis. We discuss the evaluation theory of skew polynomials, its relation with linearized polynomials, and the resulting families of maximum sum-rank distance (MSRD) codes. We also highlight recent developments, including new constructions, connections with linearized Reed–Solomon codes, and implications for efficient decoding algorithms.
Add Event to Calendar