URN to cite this document: urn:nbn:de:bvb:703-epub-3345-3
Title data
Kiermaier, Michael ; Kurz, Sascha:
An improvement of the Johnson bound for subspace codes.
Bayreuth
,
2017
. - 9 S.
There is a more recent version of this item available.
|
|||||||||
Download (160kB)
|
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 > 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-3345-3 |
Date Deposited: | 13 Jul 2017 05:50 |
Last Modified: | 13 Jul 2017 05:50 |
URI: | https://epub.uni-bayreuth.de/id/eprint/3345 |
Available Versions of this Item
- An improvement of the Johnson bound for subspace codes. (deposited 13 Jul 2017 05:50) [Currently Displayed]