Anmelden
Literature by the same author
plus at Google Scholar
Bibliografische Daten exportieren		  

Combining subspace codes

Title data

Cossidente, Antonio ; Kurz, Sascha ; Marino, Giuseppe ; Pavese, Francesco:
Combining subspace codes.
Bayreuth , 2021 . - 17 p.
DOI: https://doi.org/10.15495/EPub_UBT_00005905

This is the latest version of this item.

Official URL: Volltext

Abstract in another language

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)
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
Result of work at the UBT: Yes
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
Date Deposited: 23 Nov 2021 09:52
Last Modified: 23 Nov 2021 09:52
URI: https://eref.uni-bayreuth.de/id/eprint/67977

Available Versions of this Item