at Google ScholarTitle data
Heinlein, Daniel ; Kurz, Sascha:
Coset construction for subspace codes.
Bayreuth
,
2015
. - 17 p.
Official URL: 
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 young research area of network coding is to compute good lower and upper bounds of the achievable so-called subspace codes in PG(n,q) 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 several of the previously best known subspace codes and attains the MRD bound for an infinite family of parameters.
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | Constant dimension codes; subspace codes; subspace distance; Echelon-Ferrers construction |
| Subject classification: | MSC: 05B25, 51E20 (51E22, 51E23) |
| Institutions of the University: | Faculties 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 |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 16 Jan 2016 22:00 |
| Last Modified: | 20 Mar 2019 15:16 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/29725 |