default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLijun Ji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j56]Shuangqing Liu
, Lijun Ji:
Combinatorial constructions of optimal low-power error-correcting cooling codes. Des. Codes Cryptogr. 92(8): 2235-2252 (2024)- [j55]Juanjuan Xu, Lijun Ji:
Special overlarge sets of Kirkman triple systems. Des. Codes Cryptogr. 92(8): 2267-2285 (2024) - [j54]Shuhui Yu, Lijun Ji:
Two new constructions of cyclic subspace codes via Sidon spaces. Des. Codes Cryptogr. 92(11): 3799-3811 (2024) - 2023
- [j53]Shuangqing Liu, Lijun Ji:
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs. Discret. Math. 346(8): 113477 (2023) - [j52]Shuhui Yu, Lijun Ji:
Almost affinely disjoint subspaces and covering Grassmannian codes. Finite Fields Their Appl. 92: 102292 (2023) - [j51]Lijun Ji, Danfeng Yan, Zhuoran Cheng, Yan Song:
Improving unified named entity recognition by incorporating mention relevance. Neural Comput. Appl. 35(30): 22223-22234 (2023) - [j50]Shuangqing Liu, Lijun Ji:
Double Multilevel Constructions for Constant Dimension Codes. IEEE Trans. Inf. Theory 69(1): 157-168 (2023) - 2022
- [j49]Shuhui Yu, Lijun Ji, Shuangqing Liu:
Bilateral multilevel construction of constant dimension codes. Adv. Math. Commun. 16(4): 1165-1183 (2022) - [j48]Jingjun Bao, Lijun Ji:
Large sets of t-designs over finite fields exist for all t. Des. Codes Cryptogr. 90(7): 1599-1609 (2022) - [j47]Lijun Ji, Miao Liang, Yanting Wang:
Combinational constructions of splitting authentication codes with perfect secrecy. Des. Codes Cryptogr. 90(10): 2491-2515 (2022) - [j46]Juanjuan Xu, Lijun Ji:
New results on LR-designs and OLKTSs. Discret. Math. 345(9): 112948 (2022) - 2021
- [j45]Juanjuan Xu, Lijun Ji:
Large sets of Kirkman triple systems of orders 22n+1+1. Discret. Math. 344(6): 112373 (2021) - [j44]Lijun Ji, Xiao-Nan Lu:
Symmetric abelian group-invariant Steiner quadruple systems. J. Comb. Theory A 181: 105435 (2021) - 2020
- [j43]Juanjuan Xu, Jingjun Bao, Lijun Ji:
Doubly resolvable Steiner quadruple systems of orders 22n+1. Des. Codes Cryptogr. 88(11): 2377-2386 (2020) - [j42]Lijun Ji:
Existence of Steiner quadruple systems with an almost spanning block design. Discret. Math. 343(6): 111708 (2020) - 2019
- [j41]Miao Liang, Lijun Ji:
On (t, L)-fold perfect authentication and secrecy codes with arbitration. Des. Codes Cryptogr. 87(9): 2003-2026 (2019) - [j40]Xin Wang, Jie Cui, Lijun Ji:
Linear (2, p, p)-AONTs exist for all primes p. Des. Codes Cryptogr. 87(10): 2185-2197 (2019) - [j39]Miao Liang, Lijun Ji:
Optimal ternary constant-composition codes with weight four and distance three. Discret. Math. 342(4): 1079-1088 (2019) - [j38]Jingjun Bao, Lijun Ji:
Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs. Graphs Comb. 35(2): 373-392 (2019) - 2018
- [j37]Jingyuan Chen, Lijun Ji, Yun Li:
Combinatorial constructions of optimal (m, n, 4, 2) optical orthogonal signature pattern codes. Des. Codes Cryptogr. 86(7): 1499-1525 (2018) - [j36]Lijun Ji:
Group divisible designs with large block sizes. Des. Codes Cryptogr. 86(10): 2255-2260 (2018) - [j35]Jingjun Bao, Lijun Ji, Ruizhong Wei, Yong Zhang:
New existence and nonexistence results for strong external difference families. Discret. Math. 341(6): 1798-1805 (2018) - [j34]Lijun Ji, Baokun Ding, Xin Wang, Gennian Ge:
Asymptotically Optimal Optical Orthogonal Signature Pattern Codes. IEEE Trans. Inf. Theory 64(7): 5419-5431 (2018) - 2017
- [j33]Miao Liang, Lijun Ji, Jingcai Zhang:
Some new classes of 2-fold optimal or perfect splitting authentication codes. Cryptogr. Commun. 9(3): 407-430 (2017) - [j32]Jingyuan Chen, Lijun Ji, Yun Li:
New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4. Des. Codes Cryptogr. 85(2): 299-318 (2017) - [j31]Yun Li, Lijun Ji:
Constructions of dihedral Steiner quadruple systems. Discret. Math. 340(3): 351-360 (2017) - [j30]Yanxun Chang, Lijun Ji, Hao Zheng:
A completion of LS(2n41). Discret. Math. 340(5): 1080-1085 (2017) - 2016
- [j29]Lijun Ji, Zhengwu Dong:
Existence of optimal strong partially balanced 3-designs with block size four. Des. Codes Cryptogr. 79(1): 19-36 (2016) - [j28]Jingjun Bao, Lijun Ji:
Frequency Hopping Sequences With Optimal Partial Hamming Correlation. IEEE Trans. Inf. Theory 62(6): 3768-3783 (2016) - [j27]Jingjun Bao, Lijun Ji:
New Families of Optimal Frequency Hopping Sequence Sets. IEEE Trans. Inf. Theory 62(9): 5209-5224 (2016) - 2015
- [j26]Trent G. Marbach, Lijun Ji:
The Spectrum for 3-Way k-Homogeneous Latin Trades. Electron. J. Comb. 22(4): 4 (2015) - [j25]Jingjun Bao, Lijun Ji:
The completion determination of optimal (3, 4)-packings. Des. Codes Cryptogr. 77(1): 217-229 (2015) - [j24]Jingjun Bao, Lijun Ji, Yang Li, Chengmin Wang:
Some series of optimal multilength OOCs of weight four. Discret. Math. 338(12): 2549-2561 (2015) - [j23]Jingjun Bao, Lijun Ji, Yang Li, Chengmin Wang:
Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs. Finite Fields Their Appl. 35: 139-158 (2015) - 2013
- [j22]Lijun Ji, Rui Shen:
Constructions for large sets of v-1 {0, v/3}-intersecting Steiner triple systems of order v. Discret. Math. 313(20): 2094-2103 (2013) - [j21]Liangzhong Xiang, Lijun Ji, Tao Zhang, Bo Wang, Jianjun Yang, Qizhi Zhang, Max S. Jiang, Junli Zhou, Paul R. Carney, Huabei Jiang:
Noninvasive real time tomographic imaging of epileptic foci and networks. NeuroImage 66: 240-248 (2013) - [j20]Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin:
Maximum Distance Separable Codes for Symbol-Pair Read Channels. IEEE Trans. Inf. Theory 59(11): 7259-7267 (2013) - 2012
- [j19]Yeow Meng Chee, Lijun Ji, Andrew Lim, Anthony K. H. Tung:
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory. Discret. Appl. Math. 160(1-2): 100-107 (2012) - [j18]Lijun Ji, Yang Li, Jianxing Yin:
Constructions of covering arrays of strength five. Des. Codes Cryptogr. 62(2): 199-208 (2012) - [j17]Lijun Ji:
Existence of Steiner quadruple systems with a spanning block design. Discret. Math. 312(5): 920-932 (2012) - [j16]Minquan Cheng, Lijun Ji, Ying Miao:
Separable Codes. IEEE Trans. Inf. Theory 58(3): 1791-1803 (2012) - 2011
- [j15]Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin:
List decodability at small radii. Des. Codes Cryptogr. 61(2): 151-166 (2011) - [j14]Jianxing Yin, Jianmin Wang, Lijun Ji, Yang Li:
On the existence of orthogonal arrays OA(3, 5, 4n+2). J. Comb. Theory A 118(1): 270-276 (2011) - 2010
- [j13]Zhaoping Meng, Lijun Ji, Beiliang Du:
The existence of augmented resolvable Steiner quadruple systems. Discret. Math. 310(13-14): 2007-2020 (2010) - [j12]Lijun Ji, Jianxing Yin:
Constructions of new orthogonal arrays and covering arrays of strength three. J. Comb. Theory A 117(3): 236-247 (2010) - 2009
- [j11]Yang Li, Lijun Ji, Jianxing Yin:
Covering arrays of strength 3 and 4 from holey difference matrices. Des. Codes Cryptogr. 50(3): 339-350 (2009) - [j10]Zhaoping Meng, Lijun Ji, Beiliang Du:
Uniformly resolvable three-wise balanced designs with block sizes four and six. Discret. Math. 309(23-24): 6470-6482 (2009) - 2008
- [j9]Lijun Ji, Jianguo Lei:
Further results on large sets of Kirkman triple systems. Discret. Math. 308(20): 4643-4652 (2008) - [j8]Tao Feng, Yanxun Chang, Lijun Ji:
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with lambda=2. J. Comb. Theory A 115(8): 1527-1551 (2008) - 2007
- [j7]Lijun Ji:
A construction for large sets of disjoint Kirkman triple systems. Des. Codes Cryptogr. 43(2-3): 115-122 (2007) - [j6]Lijun Ji:
Constructions for large sets of L -intersecting Steiner triple systems. Des. Codes Cryptogr. 45(1): 39-49 (2007) - [j5]Haitao Cao, Lijun Ji, Lie Zhu:
Constructions for generalized Steiner systems GS (3, 4, v , 2). Des. Codes Cryptogr. 45(2): 185-197 (2007) - 2006
- [j4]Jinhua Wang, Lijun Ji:
A note on pandecomposable (v, 4, 2)-BIBDs with subsystems. Australas. J Comb. 36: 223-230 (2006) - [j3]Lijun Ji:
Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4. Graphs Comb. 22(2): 251-260 (2006) - 2005
- [j2]Lijun Ji, Lie Zhu:
Resolvable Steiner Quadruple Systems for the Last 23 Orders. SIAM J. Discret. Math. 19(2): 420-430 (2005) - 2003
- [j1]Lijun Ji, Lie Zhu:
Constructions for Steiner quadruple systems with a spanning block design. Discret. Math. 261(1-3): 347-360 (2003)
Conference and Workshop Papers
- 2022
- [c1]Yi Yang, Qihui Cui, Lijun Ji, Zhuoran Cheng:
Graph Convolution Word Embedding and Attention for Text Classification∗. ICMLSC 2022: 160-166
Informal and Other Publications
- 2023
- [i8]Shuhui Yu, Lijun Ji:
New constructions of cyclic subspace codes. CoRR abs/2305.15627 (2023) - [i7]Shuangqing Liu, Shuhui Yu, Lijun Ji:
Construction of optimal optimum distance flag codes by MRD codes. CoRR abs/2310.11285 (2023) - 2018
- [i6]Xin Wang, Jie Cui, Lijun Ji:
Linear (2, p, p)-AONTs do Exist. CoRR abs/1804.10491 (2018) - 2015
- [i5]Jingjun Bao, Lijun Ji:
New families of optimal frequency hopping sequence sets. CoRR abs/1506.07372 (2015) - [i4]Jingjun Bao, Lijun Ji:
Frequency hopping sequences with optimal partial Hamming correlation. CoRR abs/1511.02924 (2015) - [i3]Jingyuan Chen, Yun Li, Lijun Ji:
Combinatorial Constructions of Optimal (m, n, 4, 2) Optical Orthogonal Signature Pattern Codes. CoRR abs/1511.09289 (2015) - 2012
- [i2]Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin:
Maximum Distance Separable Codes for Symbol-Pair Read Channels. CoRR abs/1211.1728 (2012) - 2010
- [i1]Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin:
List Decodability at Small Radii. CoRR abs/1010.3312 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
