Subspace Network Codes with Large Cardinality

Abstract

A network is considered as a directed acyclic graph. A source sends to a destination packets organized as a matrix over the finite field. Such a matrix can be treated as a subspace over the finite field spanned by matrix rows. We investigate an important problem how to construct subspace network codes with large cardinality. We obtained conditions where these codes have maximal cardinality.