2 citations · 4 across the 6 of their papers we have counts for
8 papers · 1 filter
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…
Triangle decompositions of
Yueting Li, Yanxun Chang, Tao Feng
Denote by the complete graph of order with multiplicity . Let be the graph obtained from by the removal of the edges of two vertex disjoint co…
Leaves for packings with block size four
Yanxun Chang, Peter J. Dukes, Tao Feng
We consider maximum packings of edge-disjoint -cliques in the complete graph . When or , these are simply block designs. In other congruence class…
Strong difference families of special types
Yanxun Chang, Simone Costa, Tao Feng +1
Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. A…
New bounds on the maximum size of Sperner partition systems
Yanxun Chang, Charles J. Colbourn, Adam Gowty +2
An -Sperner partition system is a collection of partitions of some -set, each into nonempty classes, such that no class of any partition is a subset of a class of any…
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…