Junling Zhou

activity

20102025

most citedNew bounds on the maximum size of Sperner partition systems

4 citations · 6 across the 10 of their papers we have counts for

collaborators

10 papers

math.CO2025★ 1 cited

The existence of pyramidal Steiner triple systems over abelian groups

Yanxun Chang, Tommaso Traetta, Junling Zhou

A Steiner triple system STS $(v)$ is called $f$ -pyramidal if it has an automorphism group fixing $f$ points and acting sharply transitively on the remaining $v - f$ points. In this pa…

math.CO2022

Suboptimal $s$ -union familes and $s$ -union antichains for vector spaces

Yunjing Shan, Junling Zhou

Let $V$ be an $n$ -dimensional vector space over the finite field $F_{q}$ , and let $L (V) = ⋃_{0 \leq k \leq n} [k V]$ be the set of all subspaces…

math.CO2021

Optimal data placements for triple replication

Ruijing Liu, Junling Zhou

Given a set $V$ of $v$ servers along with $b$ files (data), each file is replicated (placed) on exactly $k$ servers and thus a file can be represented by a set of $k$ servers. Then…

cs.IT2021

Infinite families of linear codes supporting more $t$ -designs

Qianqian Yan, Junling Zhou

Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $C_{(q, q + 1, 4, 1)}$ and their dual codes with $q = 2^{m}$ and established that the codewor…

math.CO2020

Large Sets with Multiplicity

Tuvi Etzion, Junling Zhou

Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same…

math.CO2020

Maximum $w$ -cyclic holely group divisible packings with block size three and applications to optical orthogonal codes

Zenghui Fang, Junling Zhou, Lidong Wang

In this paper we investigate combinatorial constructions for $w$ -cyclic holely group divisible packings with block size three (briefly by $3$ -HGDPs). For any positive integers $u,v…

The existence of pyramidal Steiner triple systems over abelian groups

Suboptimal s-union familes and s-union antichains for vector spaces

Optimal data placements for triple replication

Infinite families of linear codes supporting more t-designs

Large Sets with Multiplicity

Maximum w-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes

Suboptimal $s$ -union familes and $s$ -union antichains for vector spaces

Infinite families of linear codes supporting more $t$ -designs

Maximum $w$ -cyclic holely group divisible packings with block size three and applications to optical orthogonal codes