at Google ScholarTitle data
Kurz, Sascha:
Bounds for flag codes.
Bayreuth
,
2021
. - 23 p.
DOI: https://doi.org/10.15495/EPub_UBT_00005430
Official URL: 
Abstract in another language
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) |
| 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 May 2021 21:00 |
| Last Modified: | 10 May 2021 05:32 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/65148 |