Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Bounds for flag codes

DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00005430
URN to cite this document: urn:nbn:de:bvb:703-epub-5430-6

Title data

Kurz, Sascha:
Bounds for flag codes.
Bayreuth , 2021 . - 23 S.

This is the latest version of this item.

[img]
Format: PDF
Name: work_flag_codes_revised.pdf
Version: Published Version
Available under License Creative Commons BY 4.0: Attribution
Download (363kB)

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-5430-6
Date Deposited: 03 May 2021 10:23
Last Modified: 03 May 2021 10:24
URI: https://epub.uni-bayreuth.de/id/eprint/5430

Available Versions of this Item

Downloads

Downloads per month over past year