We construct a secure network coding that is strongly secure in the sense of Harada and Yamamoto [19] and universal secure in the sense of Silva and Kschischang [28], [29], while allowing arbitrary small but nonzero mutual information to the eavesdropper. Our secure network coding allows statistically dependent and non-uniform multiple secret messages, while all previous constructions of weakly...

We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.

Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding. Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective qr-divisible codes.