Optimal additive and linear b-symbol codes for large distances

Titelangaben

Kurz, Sascha:
Optimal additive and linear b-symbol codes for large distances.
2025
Veranstaltung: New Mathematical Directions in Coding Theory - Oberwolfach Workshop , 07.-12.09.2025 , Oberwolfach, Deutschland.
(Veranstaltungsbeitrag: Workshop , Vortrag )

Weitere URLs

Abstract

For linear codes over finite fields the optimal parameters are attained by the so-called Griesmer bound (1960) if the minimum distance is sufficiently large. A corresponding geometric construction was given by Solomon and Stiffler (1965). Here we present an analogous result for addittive codes over finite fields and for linear codes with respect to the b-symbol metric. The latter class was introduced by Cassuto and Blaum in 2011 for the special case b=2 and called pair-symbol codes. Here we also present a geometric description of these codes.