Lijun Ji

Orcid: 0000-0002-2003-9450

According to our database1, Lijun Ji authored at least 57 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Almost affinely disjoint subspaces and covering Grassmannian codes.
Finite Fields Their Appl., December, 2023

Improving unified named entity recognition by incorporating mention relevance.
Neural Comput. Appl., October, 2023

Constant dimension codes from multilevel construction based on matchings of complete hypergraphs.
Discret. Math., August, 2023

Double Multilevel Constructions for Constant Dimension Codes.
IEEE Trans. Inf. Theory, 2023

Construction of optimal optimum distance flag codes by MRD codes.
CoRR, 2023

New constructions of cyclic subspace codes.
CoRR, 2023

2022
New results on LR-designs and OLKTSs.
Discret. Math., 2022

Combinational constructions of splitting authentication codes with perfect secrecy.
Des. Codes Cryptogr., 2022

Large sets of t-designs over finite fields exist for all t.
Des. Codes Cryptogr., 2022

Bilateral multilevel construction of constant dimension codes.
Adv. Math. Commun., 2022

Graph Convolution Word Embedding and Attention for Text Classification∗.
Proceedings of the ICMLSC 2022: The 6th International Conference on Machine Learning and Soft Computing, Haikou, China, January 15, 2022

2021
Symmetric abelian group-invariant Steiner quadruple systems.
J. Comb. Theory, Ser. A, 2021

Large sets of Kirkman triple systems of orders 22n+1+1.
Discret. Math., 2021

2020
Existence of Steiner quadruple systems with an almost spanning block design.
Discret. Math., 2020

Doubly resolvable Steiner quadruple systems of orders 2<sup>2n+1</sup>.
Des. Codes Cryptogr., 2020

2019
Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs.
Graphs Comb., 2019

Optimal ternary constant-composition codes with weight four and distance three.
Discret. Math., 2019

Linear (2, p, p)-AONTs exist for all primes p.
Des. Codes Cryptogr., 2019

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

2018
Asymptotically Optimal Optical Orthogonal Signature Pattern Codes.
IEEE Trans. Inf. Theory, 2018

New existence and nonexistence results for strong external difference families.
Discret. Math., 2018

Group divisible designs with large block sizes.
Des. Codes Cryptogr., 2018

Combinatorial constructions of optimal (m, n, 4, 2) optical orthogonal signature pattern codes.
Des. Codes Cryptogr., 2018

Linear (2, p, p)-AONTs do Exist.
CoRR, 2018

2017
Constructions of dihedral Steiner quadruple systems.
Discret. Math., 2017

A completion of LS(2<sup>n</sup>4<sup>1</sup>).
Discret. Math., 2017

New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4.
Des. Codes Cryptogr., 2017

Some new classes of 2-fold optimal or perfect splitting authentication codes.
Cryptogr. Commun., 2017

2016
New Families of Optimal Frequency Hopping Sequence Sets.
IEEE Trans. Inf. Theory, 2016

Frequency Hopping Sequences With Optimal Partial Hamming Correlation.
IEEE Trans. Inf. Theory, 2016

Existence of optimal strong partially balanced 3-designs with block size four.
Des. Codes Cryptogr., 2016

2015
Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs.
Finite Fields Their Appl., 2015

Some series of optimal multilength OOCs of weight four.
Discret. Math., 2015

The completion determination of optimal (3, 4)-packings.
Des. Codes Cryptogr., 2015

The Spectrum for 3-Way k-Homogeneous Latin Trades.
Electron. J. Comb., 2015

2013
Maximum Distance Separable Codes for Symbol-Pair Read Channels.
IEEE Trans. Inf. Theory, 2013

Noninvasive real time tomographic imaging of epileptic foci and networks.
NeuroImage, 2013

Constructions for large sets of v-1 {0, v/3}-intersecting Steiner triple systems of order v.
Discret. Math., 2013

2012
Separable Codes.
IEEE Trans. Inf. Theory, 2012

Existence of Steiner quadruple systems with a spanning block design.
Discret. Math., 2012

Constructions of covering arrays of strength five.
Des. Codes Cryptogr., 2012

Arboricity: An acyclic hypergraph decomposition problem motivated by database theory.
Discret. Appl. Math., 2012

2011
On the existence of orthogonal arrays OA(3, 5, 4n+2).
J. Comb. Theory, Ser. A, 2011

List decodability at small radii.
Des. Codes Cryptogr., 2011

2010
Constructions of new orthogonal arrays and covering arrays of strength three.
J. Comb. Theory, Ser. A, 2010

The existence of augmented resolvable Steiner quadruple systems.
Discret. Math., 2010

2009
Uniformly resolvable three-wise balanced designs with block sizes four and six.
Discret. Math., 2009

Covering arrays of strength 3 and 4 from holey difference matrices.
Des. Codes Cryptogr., 2009

2008
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with lambda=2.
J. Comb. Theory, Ser. A, 2008

Further results on large sets of Kirkman triple systems.
Discret. Math., 2008

2007
Constructions for large sets of <i>L</i> -intersecting Steiner triple systems.
Des. Codes Cryptogr., 2007

A construction for large sets of disjoint Kirkman triple systems.
Des. Codes Cryptogr., 2007

Constructions for generalized Steiner systems <i>GS</i> (3, 4, <i>v</i> , 2).
Des. Codes Cryptogr., 2007

2006
Partition of Triples of Order 6<i>k</i>+5 into 6<i>k</i>+3 Optimal Packings and One Packing of Size 8<i>k</i>+4.
Graphs Comb., 2006

A note on pandecomposable (v, 4, 2)-BIBDs with subsystems.
Australas. J Comb., 2006

2005
Resolvable Steiner Quadruple Systems for the Last 23 Orders.
SIAM J. Discret. Math., 2005

2003
Constructions for Steiner quadruple systems with a spanning block design.
Discret. Math., 2003


  Loading...