Constructions and bounds for subspace codes
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915686905806848 |
|---|---|
| author | Kurz, Sascha |
| author_facet | Kurz, Sascha |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_11766 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Constructions and bounds for subspace codes Kurz, Sascha Information Theory Combinatorics 51E23 (05B40 11T71 94B25) 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. |
| title | Constructions and bounds for subspace codes |
| topic | Information Theory Combinatorics 51E23 (05B40 11T71 94B25) |
| url | https://arxiv.org/abs/2112.11766 |