URN to cite this document: urn:nbn:de:bvb:703-epub-3655-4
Title data
Heinlein, Daniel ; Kurz, Sascha:
Binary subspace codes in small ambient spaces.
Bayreuth
,
2018
. - 20 S.
![]() |
|
||||||||
Download (412kB)
|
Project information
Project title: |
Project's official title Project's id Ganzzahlige Optimierungsmodelle für Subspace Codes und endliche Geometrie No information |
---|---|
Project financing: |
Deutsche Forschungsgemeinschaft |
Abstract
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for projective dimensions of at most $7$. We obtain several improvements of the bounds and perform two classifications of optimal subspace codes, which are unknown so far in the literature.
Further data
Item Type: | Preprint, postprint |
---|---|
Additional notes (visible to public): | erschienen in:
Advances in Mathematics of Communications. Bd. 12 (November 2018) Heft 4 . - S. 817-839. DOI: https://doi.org/10.3934/amc.2018048 |
Keywords: | Galois geometry; network coding; subspace code; partial spread |
Subject classification: | Mathematics Subject Classification Code: 94B05 05B25 51E20 (51E14 51E22 51E23) |
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 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 |
Language: | English |
Originates at UBT: | Yes |
URN: | urn:nbn:de:bvb:703-epub-3655-4 |
Date Deposited: | 09 Apr 2018 07:00 |
Last Modified: | 14 May 2021 07:42 |
URI: | https://epub.uni-bayreuth.de/id/eprint/3655 |