Bounds on cardinality of multicomponent network codes

Valentin B. Afanassiev, E.M. Gabidulin, Nina I. Pilipchuk · 2014

Network coding is a new direction of communications and information theory. Algebraic coding in this area is based on Grassmann metric known also as subspace metric. The paper is devoted to some bounds on cardinality of codes in Grassmann metric.

Read the paper · More papers on PaperTik