Constructions for Steiner quadruple systems with a spanning block design. - Lijun Ji; Lie Zhu (Discret. Math., 2003)

Resolvable Steiner Quadruple Systems for the Last 23 Orders. - Lijun Ji; Lie Zhu (SIAM J. Discret. Math., 2005)

A note on pandecomposable (v, 4, 2)-BIBDs with subsystems. - Jinhua Wang; Lijun Ji (Australas. J Comb., 2006)

Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4. - Lijun Ji (Graphs Comb., 2006)

Constructions for generalized Steiner systems GS (3, 4, v , 2). - Haitao Cao 001; Lijun Ji; Lie Zhu (Des. Codes Cryptogr., 2007)

A construction for large sets of disjoint Kirkman triple systems. - Lijun Ji (Des. Codes Cryptogr., 2007)

Constructions for large sets of L -intersecting Steiner triple systems. - Lijun Ji (Des. Codes Cryptogr., 2007)

Further results on large sets of Kirkman triple systems. - Lijun Ji; Jianguo Lei (Discret. Math., 2008)

Constructions for strictly cyclic 3-designs and applications to optimal OOCs with lambda=2. - Tao Feng 002; Yanxun Chang; Lijun Ji (J. Comb. Theory A, 2008)

Covering arrays of strength 3 and 4 from holey difference matrices. - Yang Li; Lijun Ji; Jianxing Yin (Des. Codes Cryptogr., 2009)

Uniformly resolvable three-wise balanced designs with block sizes four and six. - Zhaoping Meng; Lijun Ji; Beiliang Du (Discret. Math., 2009)

The existence of augmented resolvable Steiner quadruple systems. - Zhaoping Meng; Lijun Ji; Beiliang Du (Discret. Math., 2010)

Constructions of new orthogonal arrays and covering arrays of strength three. - Lijun Ji; Jianxing Yin (J. Comb. Theory A, 2010)

List decodability at small radii. - Yeow Meng Chee; Gennian Ge; Lijun Ji; San Ling; Jianxing Yin (Des. Codes Cryptogr., 2011)

On the existence of orthogonal arrays OA(3, 5, 4n+2). - Jianxing Yin; Jianmin Wang 003; Lijun Ji; Yang Li (J. Comb. Theory A, 2011)

Arboricity: An acyclic hypergraph decomposition problem motivated by database theory. - Yeow Meng Chee; Lijun Ji; Andrew Lim 001; Anthony K. H. Tung (Discret. Appl. Math., 2012)

Constructions of covering arrays of strength five. - Lijun Ji; Yang Li; Jianxing Yin (Des. Codes Cryptogr., 2012)

Existence of Steiner quadruple systems with a spanning block design. - Lijun Ji (Discret. Math., 2012)

Separable Codes. - Minquan Cheng; Lijun Ji; Ying Miao 001 (IEEE Trans. Inf. Theory, 2012)

Constructions for large sets of v-1 {0, v/3}-intersecting Steiner triple systems of order v. - Lijun Ji; Rui Shen (Discret. Math., 2013)

Noninvasive real time tomographic imaging of epileptic foci and networks. - Liangzhong Xiang; Lijun Ji; Tao Zhang; Bo Wang; Jianjun Yang; Qizhi Zhang; Max S. Jiang; Junli Zhou; Paul R. Carney; Huabei Jiang (NeuroImage, 2013)

Maximum Distance Separable Codes for Symbol-Pair Read Channels. - Yeow Meng Chee; Lijun Ji; Han Mao Kiah; Chengmin Wang; Jianxing Yin (IEEE Trans. Inf. Theory, 2013)

The Spectrum for 3-Way k-Homogeneous Latin Trades. - Trent G. Marbach; Lijun Ji (Electron. J. Comb., 2015)

The completion determination of optimal (3, 4)-packings. - Jingjun Bao; Lijun Ji (Des. Codes Cryptogr., 2015)

Some series of optimal multilength OOCs of weight four. - Jingjun Bao; Lijun Ji; Yang Li; Chengmin Wang (Discret. Math., 2015)

Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs. - Jingjun Bao; Lijun Ji; Yang Li; Chengmin Wang (Finite Fields Their Appl., 2015)

Existence of optimal strong partially balanced 3-designs with block size four. - Lijun Ji; Zhengwu Dong (Des. Codes Cryptogr., 2016)

Frequency Hopping Sequences With Optimal Partial Hamming Correlation. - Jingjun Bao; Lijun Ji (IEEE Trans. Inf. Theory, 2016)

New Families of Optimal Frequency Hopping Sequence Sets. - Jingjun Bao; Lijun Ji (IEEE Trans. Inf. Theory, 2016)

Some new classes of 2-fold optimal or perfect splitting authentication codes. - Miao Liang; Lijun Ji; Jingcai Zhang (Cryptogr. Commun., 2017)

New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4. - Jingyuan Chen; Lijun Ji; Yun Li (Des. Codes Cryptogr., 2017)

A completion of LS(2n41). - Yanxun Chang; Lijun Ji; Hao Zheng (Discret. Math., 2017)

Constructions of dihedral Steiner quadruple systems. - Yun Li; Lijun Ji (Discret. Math., 2017)

Linear (2, p, p)-AONTs do Exist. - Xin Wang 065; Jie Cui; Lijun Ji (CoRR, 2018)

Combinatorial constructions of optimal (m, n, 4, 2) optical orthogonal signature pattern codes. - Jingyuan Chen; Lijun Ji; Yun Li (Des. Codes Cryptogr., 2018)

Group divisible designs with large block sizes. - Lijun Ji (Des. Codes Cryptogr., 2018)

New existence and nonexistence results for strong external difference families. - Jingjun Bao; Lijun Ji; Ruizhong Wei; Yong Zhang 019 (Discret. Math., 2018)

Asymptotically Optimal Optical Orthogonal Signature Pattern Codes. - Lijun Ji; Baokun Ding; Xin Wang 065; Gennian Ge (IEEE Trans. Inf. Theory, 2018)

On (t, L)-fold perfect authentication and secrecy codes with arbitration. - Miao Liang; Lijun Ji (Des. Codes Cryptogr., 2019)

Linear (2, p, p)-AONTs exist for all primes p. - Xin Wang 065; Jie Cui; Lijun Ji (Des. Codes Cryptogr., 2019)

Optimal ternary constant-composition codes with weight four and distance three. - Miao Liang; Lijun Ji (Discret. Math., 2019)

Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs. - Jingjun Bao; Lijun Ji (Graphs Comb., 2019)

Doubly resolvable Steiner quadruple systems of orders 22n+1. - Juanjuan Xu; Jingjun Bao; Lijun Ji (Des. Codes Cryptogr., 2020)

Existence of Steiner quadruple systems with an almost spanning block design. - Lijun Ji (Discret. Math., 2020)

Large sets of Kirkman triple systems of orders 22n+1+1. - Juanjuan Xu; Lijun Ji (Discret. Math., 2021)

Symmetric abelian group-invariant Steiner quadruple systems. - Lijun Ji; Xiao-Nan Lu (J. Comb. Theory A, 2021)

Graph Convolution Word Embedding and Attention for Text Classification∗. - Yi Yang; Qihui Cui; Lijun Ji; Zhuoran Cheng (ICMLSC, 2022)

Bilateral multilevel construction of constant dimension codes. - Shuhui Yu; Lijun Ji; Shuangqing Liu (Adv. Math. Commun., 2022)

Large sets of t-designs over finite fields exist for all t. - Jingjun Bao; Lijun Ji (Des. Codes Cryptogr., 2022)

Combinational constructions of splitting authentication codes with perfect secrecy. - Lijun Ji; Miao Liang; Yanting Wang (Des. Codes Cryptogr., 2022)

New results on LR-designs and OLKTSs. - Juanjuan Xu; Lijun Ji (Discret. Math., 2022)

New constructions of cyclic subspace codes. - Shuhui Yu; Lijun Ji (CoRR, 2023)

Construction of optimal optimum distance flag codes by MRD codes. - Shuangqing Liu; Shuhui Yu; Lijun Ji (CoRR, 2023)

Double Multilevel Constructions for Constant Dimension Codes. - Shuangqing Liu; Lijun Ji (IEEE Trans. Inf. Theory, 2023)

Constant dimension codes from multilevel construction based on matchings of complete hypergraphs. - Shuangqing Liu; Lijun Ji (Discret. Math., 2023)

Improving unified named entity recognition by incorporating mention relevance. - Lijun Ji; Danfeng Yan; Zhuoran Cheng; Yan Song (Neural Comput. Appl., 2023)

Almost affinely disjoint subspaces and covering Grassmannian codes. - Shuhui Yu; Lijun Ji (Finite Fields Their Appl., 2023)

Combinatorial constructions of optimal low-power error-correcting cooling codes. - Shuangqing Liu; Lijun Ji (Des. Codes Cryptogr., 2024)

Special overlarge sets of Kirkman triple systems. - Juanjuan Xu; Lijun Ji (Des. Codes Cryptogr., 2024)

Two new constructions of cyclic subspace codes via Sidon spaces. - Shuhui Yu; Lijun Ji (Des. Codes Cryptogr., 2024)

Construction of optimal flag codes by MRD codes. - Shuangqing Liu; Shuhui Yu; Lijun Ji (Des. Codes Cryptogr., 2025)

s-almost t-intersecting families for vector spaces. - Lijun Ji; Dehai Liu; Kaishun Wang; Tian Yao; Shuhui Yu (Discret. Math., 2026)

On optimal placement delivery arrays. - Lijun Ji; Ruizhong Wei; Liying Yu (Discret. Math., 2026)