at Google ScholarTitle data
Heinlein, Daniel ; Kurz, Sascha:
Coset Construction for Subspace Codes.
In: IEEE Transactions on Information Theory.
Vol. 63
(2017)
Issue 12
.
- pp. 7651-7660.
ISSN 0018-9448
DOI: https://doi.org/10.1109/TIT.2017.2753822
Project information
| Project title: |
Project's official title Project's id Ganzzahlige Optimierungsmodelle für Subspace Codes und endliche Geometrie No information |
|---|---|
| Project financing: |
Deutsche Forschungsgemeinschaft |
Abstract in another language
One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in Pq(n), i.e., the set of subspaces of Fnq , for a given minimal distance. Here we generalize a construction of Etzion and Silberstein to a wide range of parameters. This construction, named coset construction, improves or attains several of the previously best-known subspace code sizes and attains the MRD bound for an infinite family of parameters.
Further data
| Item Type: | Article in a journal |
|---|---|
| Refereed: | Yes |
| Keywords: | Constant dimension codes; subspace codes; subspace distance; Echelon-Ferrers construction |
| Subject classification: | MSC: 05B25, 51E20 (51E22, 51E23) |
| 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: | 08 Nov 2017 10:11 |
| Last Modified: | 15 Feb 2022 13:22 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/40356 |