DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00004845
URN to cite this document: urn:nbn:de:bvb:703-epub-4845-4
URN to cite this document: urn:nbn:de:bvb:703-epub-4845-4
Title data
Kurz, Sascha:
Bounds for flag codes.
Bayreuth
,
2020
. - 22 S.
There is a more recent version of this item available.
|
|||||||||
Download (326kB)
|
Abstract
The application of flags to network coding has been introduced recently by Liebhold, Nebe, and Vazquez-Castro. It is a variant to random linear network coding and explicit routing solutions for given networks. Here we study lower and upper bounds for the maximum possible cardinality of a corresponding flag code with given parameters.
Further data
Item Type: | Preprint, postprint |
---|---|
Keywords: | Network coding; flag codes; error correcting codes; Grassmann distance on flags; bounds |
Subject classification: | Mathematics Subject Classification Code: 51E20 94B65 (94B99 05B25) |
DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
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 |
Language: | English |
Originates at UBT: | Yes |
URN: | urn:nbn:de:bvb:703-epub-4845-4 |
Date Deposited: | 11 May 2020 06:57 |
Last Modified: | 11 May 2020 06:57 |
URI: | https://epub.uni-bayreuth.de/id/eprint/4845 |
Available Versions of this Item
- Bounds for flag codes. (deposited 11 May 2020 06:57) [Currently Displayed]