at Google ScholarTitle data
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Johnson type bounds for mixed dimension subspace codes.
Bayreuth
,
2019
. - 16 p.
This is the latest version of this item.
Official URL: 
Related URLs
Abstract in another language
Subspace codes, i.e., sets of subspaces of GF(q)^v, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | Galois geometry; network coding; subspace code; partial spread |
| Subject classification: | Mathematics Subject Classification Code: 05B25 51E20 (51E14 51E23) |
| 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 Mathematics II (Computer Algebra) Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties Faculties > Faculty of Mathematics, Physics und Computer Science |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 21 Jan 2019 07:25 |
| Last Modified: | 14 Mar 2019 13:55 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/46952 |
Available Versions of this Item
-
Johnson type bounds for mixed dimension subspace codes. (deposited 15 Sep 2018 21:00)
- Johnson type bounds for mixed dimension subspace codes. (deposited 21 Jan 2019 07:25) [Currently Displayed]