in the repository
URN to cite this document: urn:nbn:de:bvb:703-epub-3697-2
Title data
Kiermaier, Michael ; Kurz, Sascha:
An improvement of the Johnson bound for subspace codes.
Bayreuth
,
2018
. - 12 S.
This is the latest version of this item.
![[thumbnail of upper_bounds_cdc_arxiv.pdf]](https://epub.uni-bayreuth.de/style/images/fileicons/application_pdf.png) |
|
||||||||
|
Download (181kB)
|
Related URLs
Project information
| Project title: |
Project's official title Project's id Integer Linear Programming Models for Subspace Codes and Finite Geometry No information |
|---|---|
| Project financing: |
Deutsche Forschungsgemeinschaft |
Abstract
Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding. Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective q^r-divisible codes.
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | subspace codes; divisible codes; Johnson bound; network coding |
| Subject classification: | Mathematics Subject Classification Code: 51E23 (05B40) |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Institutions of the University: | Faculties 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 > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics and Didactics |
| Language: | English |
| Originates at UBT: | Yes |
| URN: | urn:nbn:de:bvb:703-epub-3697-2 |
| Date Deposited: | 03 May 2018 06:35 |
| Last Modified: | 18 Mar 2019 08:57 |
| URI: | https://epub.uni-bayreuth.de/id/eprint/3697 |
Available Versions of this Item
-
An improvement of the Johnson bound for subspace codes. (deposited 13 Jul 2017 05:50)
- An improvement of the Johnson bound for subspace codes. (deposited 03 May 2018 06:35) [Currently Displayed]
Download Statistics