in the repository
DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00005933
URN to cite this document: urn:nbn:de:bvb:703-epub-5933-4
URN to cite this document: urn:nbn:de:bvb:703-epub-5933-4
Title data
Kurz, Sascha:
Construction and bounds for subspace codes.
Bayreuth
,
2021
. - I, 101 S.
There is a more recent version of this item available.
![[thumbnail of chap_subspace_codes_arxiv.pdf]](https://epub.uni-bayreuth.de/style/images/fileicons/application_pdf.png) |
|
||||||||
|
Download (700kB)
|
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-5933-4 |
| Date Deposited: | 13 Jan 2022 07:11 |
| Last Modified: | 13 Jan 2022 07:11 |
| URI: | https://epub.uni-bayreuth.de/id/eprint/5933 |
Available Versions of this Item
- Construction and bounds for subspace codes. (deposited 13 Jan 2022 07:11) [Currently Displayed]
Download Statistics