Bounds for flag codes
arXiv:2005.04768 · doi:10.1007/s10623-021-00953-w
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.
23 pages, 6 tables, typos corrected