in the repository
URN to cite this document: urn:nbn:de:bvb:703-epub-4843-3
Title data
Cossidente, Antonio ; Kurz, Sascha ; Marino, Giuseppe ; Pavese, Francesco:
Combining subspace codes.
Bayreuth
,
2020
. - 17 S.
![[thumbnail of combinations_of_subspace_codes_arxiv.pdf]](https://epub.uni-bayreuth.de/style/images/fileicons/application_pdf.png) |
|
||||||||
|
Download (368kB)
|
Abstract
In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size A_q(n,d;k) of codes whose codewords are k-subspaces of GF(q)^n with minimum subspace distance d. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant-dimension subspace codes for many parameters, including A_q(10,4;5), A_q(12,4;4), A_q(12,6,6) and A_q(16,4;4).
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | constant-dimension subspace code; finite projective geometry; network coding |
| Subject classification: | Mathematics Subject Classification Code: 51E20 (05B25 94B65) |
| 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-4843-3 |
| Date Deposited: | 08 May 2020 06:48 |
| Last Modified: | 08 May 2020 06:53 |
| URI: | https://epub.uni-bayreuth.de/id/eprint/4843 |
Available Versions of this Item
-
Combining subspace codes. (deposited 11 Nov 2019 14:06)
- Combining subspace codes. (deposited 08 May 2020 06:48) [Currently Displayed]
Download Statistics