Lijun Ji

collaborators

4 papers

math.CO2026

On $ℓ$ -weakly cross $t$ -intersecting families for sets and vector spaces

Shuhui Yu, Lijun Ji

Let $[n]$ (resp. $V$ ) be an $n$ -element set (resp. $n$ -dimensional vector space over the finite field $F_{q}$ ), and $(k [ n ])$ (resp. $[k V]$ )…

math.CO2024

$s$ -almost $t$ -intersecting families for vector spaces

Shuhui Yu, Lijun Ji

Let $F$ be a family of $k$ -dimensional subspaces of an $n$ -dimensional vector space. Write $\mathcal{D}_{\mathcal{F}}(H;t)=\{F\in \mathcal{F}\colon \dim(F\cap H)\leq t \}…

math.CO2024

$s$ -almost $t$ -intersecting families for vector spaces

Lijun Ji, Dehai Liu, Kaishun Wang +2

Let $V$ be a finite dimensional vector space over a finite field, and $F$ a family consisting of $k$ -subspaces of $V$ . The family $F$ is called $t$ -intersecting…

cs.DM2024

Construction of optimal flag codes by MRD codes

Shuangqing Liu, Shuhui Yu, Lijun Ji

Flag codes have received a lot of attention due to its application in random network coding. In 2021, Alonso-GonzÃ¡lez et al. constructed optimal $(n, A)$ -Optimum distance…

On ℓ-weakly cross t-intersecting families for sets and vector spaces

s-almost t-intersecting families for vector spaces

s-almost t-intersecting families for vector spaces

Construction of optimal flag codes by MRD codes

On $ℓ$ -weakly cross $t$ -intersecting families for sets and vector spaces

$s$ -almost $t$ -intersecting families for vector spaces

$s$ -almost $t$ -intersecting families for vector spaces