at Google ScholarTitle data
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Johnson type bounds for mixed dimension subspace codes.
In: The Electronic Journal of Combinatorics.
Vol. 26
(2019)
Issue 3
.
- P3.39.
ISSN 1077-8926
DOI: https://doi.org/10.37236/8188
Official URL: 
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: | Article in a journal |
|---|---|
| Refereed: | Yes |
| 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: | 16 Sep 2019 08:36 |
| Last Modified: | 15 Jun 2023 11:41 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/52236 |