## Title data

Kurz, Sascha:

**Construction and bounds for subspace codes.**

Bayreuth
,
2021
. - I, 101 p.

DOI: https://doi.org/10.15495/EPub_UBT_00005933

## 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: | 15 Jan 2022 22:00 |

Last Modified: | 17 Jan 2022 06:30 |

URI: | https://eref.uni-bayreuth.de/id/eprint/68385 |