2 citations · 3 across the 2 of their papers we have counts for
4 papers
Bounds for the multilevel construction
Tao Feng, Sascha Kurz, Shuangqing Liu
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\…
Parallel multilevel constructions for constant dimension codes
Shuangqing Liu, Yanxun Chang, Tao Feng
Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of ne…
Several classes of optimal Ferrers diagram rank-metric codes
Shuangqing Liu, Yanxun Chang, Tao Feng
Four constructions for Ferrers diagram rank-metric (FDRM) codes are presented. The first one makes use of a characterization on generator matrices of a class of systematic maximum…
Constructions for optimal Ferrers diagram rank-metric codes
Shuangqing Liu, Yanxun Chang, Tao Feng
Optimal rank-metric codes in Ferrers diagrams can be used to construct good subspace codes. Such codes consist of matrices having zeros at certain fixed positions. This paper gener…