in the repository
URN to cite this document: urn:nbn:de:bvb:703-epub-8628-0
Title data
Kurz, Sascha:
Optimal Additive and Linear b-Symbol Codes for Large Distances.
Bayreuth
,
2025
. - 3 S.
- (Oberwolfach Reports
; 41/2025
)
![[thumbnail of MFO-extended-abstract_kurz.pdf]](https://epub.uni-bayreuth.de/style/images/fileicons/application_pdf.png) |
|
||||||||
|
Download (223kB)
|
Related 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.
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | additive codes; linear codes; Griesmer bound; Galois geometry; b-symbol distance; symbol-pair distance |
| Subject classification: | Mathematics Subject Classification Code: 05B25 94B65 (94B60) |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties Faculties > Faculty of Mathematics, Physics und Computer Science |
| Language: | English |
| Originates at UBT: | Yes |
| URN: | urn:nbn:de:bvb:703-epub-8628-0 |
| Date Deposited: | 05 Nov 2025 11:29 |
| Last Modified: | 05 Nov 2025 11:29 |
| URI: | https://epub.uni-bayreuth.de/id/eprint/8628 |
Download Statistics