BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20260329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260313T060339Z
UID:6A0E5C8B-9DF8-46C5-85DF-FC832ACADFEF
DTSTART;TZID=Europe/Paris:20260309T133000
DTEND;TZID=Europe/Paris:20260309T183000
DESCRIPTION:rank metric codes and skew polynomials (II)\n\nThis talk is a c
 ontinuation of the previous one. We present an overview of the algebraic f
 oundations underlying rank-metric and sum-rank metric codes and explain ho
 w 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 maxim
 um 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.\n\nCo-sponsore
 d by: IEEE-Paris 8-LAGA\n\nRoom: 105\, Bldg: MR\, 2 rue de la librete\, il
 e de france \, Ile-de-France\, France\, 93526
LOCATION:Room: 105\, Bldg: MR\, 2 rue de la librete\, ile de france \, Ile-
 de-France\, France\, 93526
ORGANIZER:smesnager@univ-paris8.fr
SEQUENCE:8
SUMMARY:(Sum-)rank metric codes and skew polynomials (II)
URL;VALUE=URI:https://events.vtools.ieee.org/m/545101
X-ALT-DESC:Description: <br /><p>rank metric codes and skew polynomials (II
 )</p>\n<p>This talk is a continuation of the previous one.&nbsp\; We prese
 nt an overview of the algebraic foundations underlying rank-metric and sum
 -rank metric codes and explain how skew polynomial rings provide a unifyin
 g language for their construction and analysis. We discuss the evaluation 
 theory of skew polynomials\, its relation with linearized polynomials\, an
 d the resulting families of maximum sum-rank distance (MSRD) codes. We als
 o highlight recent developments\, including new constructions\, connection
 s with linearized Reed&ndash\;Solomon codes\, and implications for efficie
 nt decoding algorithms.</p>
END:VEVENT
END:VCALENDAR