Literature by the same author
plus at Google Scholar

Bibliografische Daten exportieren
 

Constructions and bounds for subspace codes

Title data

Kurz, Sascha:
Constructions and bounds for subspace codes.
Bayreuth , 2024 . - I, 102 p.
DOI: 10.15495/EPub_UBT_00007398

This is the latest version of this item.

Official URL: Volltext

Abstract in another language

Subspace codes are the q-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random
linear network coding, distributed storage, and cryptography. In this chapter we survey known constructions and upper bounds for subspace codes.

Further data

Item Type: Preprint, postprint
Keywords: Galois geometry; subspace codes; partial spreads; constant dimension codes
Subject classification: Mathematics Subject Classification Code: 51E23 (05B40 11T71 94B25)
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: 19 Jan 2024 10:26
Last Modified: 22 Jan 2024 06:40
URI: https://eref.uni-bayreuth.de/id/eprint/88292

Available Versions of this Item