(Sum-)rank metric codes and skew polynomials (II)
#Coding
#cryptography
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.
Date and Time
Location
Hosts
Registration
-
Add Event to Calendar
- 2 rue de la librete
- ile de france , Ile-de-France
- France 93526
- Building: MR
- Room Number: 105
- Contact Event Host
- Co-sponsored by IEEE-Paris 8-LAGA
- Starts 06 March 2026 11:00 PM UTC
- Ends 08 March 2026 11:00 PM UTC
- No Admission Charge