Login
Publications by the same author
plus in the repository
plus in Google Scholar
Bibliografische Daten exportieren		  

Constructions and bounds for subspace codes

DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00007398
URN to cite this document: urn:nbn:de:bvb:703-epub-7398-2

Title data

Kurz, Sascha:
Constructions and bounds for subspace codes.
Bayreuth , 2024 . - I, 102 S.

This is the latest version of this item.

[thumbnail of chap_subspace_codes_arxiv.pdf]
Format: PDF
Name: chap_subspace_codes_arxiv.pdf
Version: Published Version
Available under License Creative Commons BY 4.0: Attribution
Download (728kB)

Abstract

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)
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-7398-2
Date Deposited: 19 Jan 2024 10:22
Last Modified: 19 Jan 2024 10:56
URI: https://epub.uni-bayreuth.de/id/eprint/7398

Available Versions of this Item

Download Statistics

Downloads

Downloads per month over past year