at Google ScholarTitle data
Kurz, Sascha:
Generalized LMRD code bounds for constant dimension codes.
Bayreuth
,
2020
. - 5 p.
DOI: https://doi.org/10.15495/EPub_UBT_00004886
Abstract in another language
In random network coding so-called constant dimension codes (CDCs) are used for error correction and detection. Most of the largest known codes contain a lifted maximum rank distance (LMRD) code as a subset. For some special cases, Etzion and Silberstein have demonstrated that one
can obtain tighter upper bounds on the maximum possible cardinality of CDCs if we assume that an LMRD code is contained. The range of applicable parameters was partially extended by Heinlein. Here we fully generalize those bounds, which also sheds some light on recent constructions.
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | constant dimension codes; lifted maximum rank distance codes; code bounds; network coding |
| Subject classification: | Mathematics Subject Classification Code: 51E20 (05B25 94B65) |
| Institutions of the University: | 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 > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics > Chair Mathematical Economics - Univ.-Prof. Dr. Jörg Rambau Faculties Faculties > Faculty of Mathematics, Physics und Computer Science |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science |
| Date Deposited: | 20 Jun 2020 21:00 |
| Last Modified: | 22 Jun 2020 06:00 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/55580 |