Title data
Kurz, Sascha:
Additive codes and their geometric counterparts.
2026
Event: Galois geometries and their applications
, 12.02.2026
, Neapel, Italien (online).
(Conference item: Lecture series
,
Speech
)
Related URLs
Abstract in another language
Geometrically additive codes correspond to multisets of subspaces in a projective space. The minmum distance corresponds to the maximum number of elements contained in a hyperplane. If the replace hyperplane by codimension f subspaces, then the coding equivalent is the generalized f-th Hamming weight of an additive (or linear) code. This opens a large geometric playground. In the talk we give a few constructions and upper bounds for the maximum number n_q(r,h,f;s) of h-spaces in PG(r-1,q) such that at most s elements are contained in each codimension f subspace.
Further data
| Item Type: | Conference item (Speech) |
|---|---|
| Refereed: | No |
| Keywords: | additive codes; Galois geometry; blocking sets; linear codes |
| Subject classification: | Mathematics Subject Classification Code: 05B25 94B65 (94B60) |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science 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 |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 22 Dec 2025 08:44 |
| Last Modified: | 22 Dec 2025 08:44 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/95508 |

at Google Scholar