default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunling Zhou
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j55]Yuli Tan, Junling Zhou:
Tilings of ℋq(n,w) with optimal (n,d,w)q-codes. Des. Codes Cryptogr. 94(6): 124 (2026)- [j54]Yanxun Chang, Zian Zhang, Junling Zhou:
Cyclic balanced incomplete block designs with block size four and arbitrary index. Discret. Math. 349(1): 114873 (2026) - [j53]Xiaoran Wang, Junling Zhou:
Infinite families of non-simple subspace 2- and 3-designs with block dimension 4. Finite Fields Their Appl. 111: 102786 (2026) - [j52]Yunjing Shan, Junling Zhou
:
On cover-free families of finite vector spaces. J. Comb. Theory, Ser. A 220: 106131 (2026) - [j51]Xueting Wang, Junling Zhou:
Hermitian dual-containing constacyclic BCH codes of new length and related quantum codes. Quantum Inf. Process. 25(3): 94 (2026) - [i3]Xinghao Wu, Junling Zhou:
Research on Linear Codes Holding q-Ary t-Designs. CoRR abs/2603.12761 (2026) - 2025
- [j50]Xueting Wang, Junling Zhou:
BCH codes with explicit minimum distance and applications in quantum synchronizable codes. Cryptogr. Commun. 17(5): 1427-1443 (2025) - [j49]Yuli Tan, Junling Zhou:
Steiner quadruple systems with minimum colorable derived designs: constructions and applications. Des. Codes Cryptogr. 93(10): 4117-4140 (2025) - [j48]Yanxun Chang, Tommaso Traetta, Junling Zhou:
The existence of pyramidal Steiner triple systems over abelian groups. Des. Codes Cryptogr. 93(12): 5517-5533 (2025) - [j47]Xiaoran Wang, Junling Zhou:
On recursive constructions for 2-designs over finite fields. J. Comb. Theory, Ser. A 213: 106006 (2025) - 2024
- [j46]Qianqian Yan, Junling Zhou:
Mutually disjoint Steiner systems from BCH codes. Des. Codes Cryptogr. 92(4): 885-907 (2024) - [j45]Junling Zhou, Na Zhang:
A Construction of Optimal 1-Spontaneous Emission Error Designs. Graphs Comb. 40(1): 13 (2024) - [j44]Yunjing Shan, Junling Zhou:
Almost Intersecting Families for Vector Spaces. Graphs Comb. 40(3): 62 (2024) - 2023
- [j43]Yunjing Shan, Junling Zhou:
Suboptimal s-union families and s-union antichains for vector spaces. Discret. Math. 346(8): 113505 (2023) - [j42]Ruijing Liu, Junling Zhou:
Further Study on Optimal Data Placements for Triple Replication. Graphs Comb. 39(1): 11 (2023) - [j41]Qianqian Yan, Junling Zhou:
The first infinite family of orthogonal Steiner systems S(3,5,v). J. Comb. Theory A 200: 105782 (2023) - [j40]Pohsun Wang, Wu Song, Junling Zhou, Yongsheng Tan, Hongkong Wang:
AI-Based Environmental Color System in Achieving Sustainable Urban Development. Syst. 11(3): 135 (2023) - 2022
- [j39]Ruijing Liu, Junling Zhou:
Optimal data placements for triple replication in distributed storage systems. Adv. Math. Commun. 16(4): 903-919 (2022) - [j38]Zenghui Fang, Junling Zhou, Lidong Wang:
Maximum w-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes. Discret. Math. 345(4): 112754 (2022) - [j37]Xusheng Xie, Junling Zhou, Xin Wen:
Evaluation and of University Building Design Effect Based on Multisensor Perception and Data Security. J. Sensors 2022: 3049887:1-3049887:9 (2022) - [j36]Qianqian Yan, Junling Zhou:
Infinite Families of Linear Codes Supporting More t-Designs. IEEE Trans. Inf. Theory 68(7): 4365-4377 (2022) - 2021
- [j35]Tuvi Etzion, Junling Zhou:
Large sets with multiplicity. Des. Codes Cryptogr. 89(7): 1661-1690 (2021) - [j34]Junling Zhou, Bohua Zhu:
Maximum sets of mutually disjoint 2-chromatic Steiner quadruple systems. Finite Fields Their Appl. 76: 101908 (2021) - [j33]Chen Pan, Junling Zhou, Xiaohua Huang:
Impact of Check-In Data on Urban Vitality in the Macao Peninsula. Sci. Program. 2021: 7179965:1-7179965:9 (2021) - [i2]Qianqian Yan, Junling Zhou:
Infinite families of linear codes supporting more t-designs. CoRR abs/2106.10903 (2021) - 2020
- [j32]Junling Zhou, Pohsun Wang, Lingfeng Xie:
Research on Resource Allocation Optimization of Smart City Based on Big Data. IEEE Access 8: 158852-158861 (2020) - [j31]Zenghui Fang, Junling Zhou:
The sizes of maximal (v, k, k-2, k-1) optical orthogonal codes. Des. Codes Cryptogr. 88(5): 807-824 (2020) - [j30]Bohua Zhu, Junling Zhou, Yanxun Chang:
2-(v, 5; m) spontaneous emission error designs. Des. Codes Cryptogr. 88(5): 951-970 (2020) - [j29]Junling Zhou, Wenling Zhou:
Wide-sense 2-frameproof codes. Des. Codes Cryptogr. 88(12): 2507-2519 (2020) - [j28]Chunxuan Mao, Junling Zhou:
The existence of 2-balanced Mendelsohn triple systems. Discret. Math. 343(2): 111652 (2020) - [j27]Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley, Junling Zhou:
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90: 103165 (2020) - [i1]Zenghui Fang, Junling Zhou, Lidong Wang:
Maximum w-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes. CoRR abs/2006.06921 (2020)
2010 – 2019
- 2019
- [j26]Yanxun Chang, Hao Zheng, Junling Zhou:
Existence of frame-derived H-designs. Des. Codes Cryptogr. 87(6): 1415-1431 (2019) - [j25]Bohua Zhu, Junling Zhou:
New lower bounds on 2-spontaneous emission error designs. Discret. Math. 342(4): 1152-1158 (2019) - 2018
- [j24]Yanxun Chang, Fengzhao Cheng, Junling Zhou:
Partial geometric difference sets and partial geometric difference families. Discret. Math. 341(9): 2490-2498 (2018) - [j23]Junling Zhou, Yanxun Chang:
Further results on 3-spontaneous emission error designs. Discret. Math. 341(11): 3057-3074 (2018) - 2017
- [j22]Hao Zheng, Yanxun Chang, Junling Zhou:
Direct constructions of large sets of Kirkman triple systems. Des. Codes Cryptogr. 83(1): 23-32 (2017) - [j21]Junling Zhou, Yanxun Chang:
Bounds and constructions of t-spontaneous emission error designs. Des. Codes Cryptogr. 85(2): 249-271 (2017) - [j20]Hao Zheng, Yanxun Chang, Junling Zhou:
Large sets of Kirkman triple systems of prime power sizes. Des. Codes Cryptogr. 85(3): 411-423 (2017) - 2015
- [j19]Mingming Geng, Junling Zhou:
Large sets of resolvable Mendelsohn triple systems of prime power sizes. Discret. Math. 338(6): 1017-1021 (2015) - 2014
- [j18]Junling Zhou, Yanxun Chang, Yinv Zhang:
On the exact size of maximum impulse radio sequences with parameters (m, k, λ, k-1). Discret. Appl. Math. 171: 122-136 (2014) - [j17]Jianying Fang, Junling Zhou, Yanxun Chang:
Nonexistence of some quantum jump codes with specified parameters. Des. Codes Cryptogr. 73(1): 223-235 (2014) - [j16]Junling Zhou, Yanxun Chang:
New large sets of resolvable Mendelsohn triple systems. Discret. Math. 328: 27-35 (2014) - [j15]Junling Zhou, Yanxun Chang:
A new result on Sylvester's problem. Discret. Math. 331: 15-19 (2014) - 2013
- [j14]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou:
TBSs in some minimum coverings. Discret. Math. 313(3): 278-285 (2013) - [j13]Junling Zhou, Yanxun Chang:
Overlarge sets of Mendelsohn triple systems with resolvability. Discret. Math. 313(4): 490-497 (2013) - [j12]Yanxun Chang, Junling Zhou, Giovanni Lo Faro, Antoinette Tripodi:
On tight blocking set in minimum coverings. Electron. Notes Discret. Math. 40: 365-370 (2013) - [j11]Yanxun Chang, Junling Zhou:
Large sets of Kirkman triple systems and related designs. J. Comb. Theory A 120(3): 649-670 (2013) - [j10]Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou:
Sequence Covering Arrays. SIAM J. Discret. Math. 27(4): 1844-1861 (2013) - 2012
- [j9]Yanxun Chang, Fan Yang, Junling Zhou:
The existence spectrum for (3, λ)-GDDs of type gtu1. Discret. Math. 312(2): 341-350 (2012) - [j8]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou:
Overlarge sets of resolvable idempotent quasigroups. Discret. Math. 312(8): 1461-1467 (2012) - 2011
- [j7]Yanxun Chang, Yeow Meng Chee, Junling Zhou:
A pair of disjoint 3-GDDs of type gtu1. Des. Codes Cryptogr. 60(1): 37-62 (2011) - [j6]Junling Zhou, Yanxun Chang, Zihong Tian:
Large sets of resolvable idempotent Latin squares. Discret. Math. 311(1): 24-31 (2011) - 2010
- [j5]Junling Zhou, Yanxun Chang:
New results on large sets of Kirkman triple systems. Des. Codes Cryptogr. 55(1): 1-7 (2010)
2000 – 2009
- 2009
- [j4]Junling Zhou, Yanxun Chang:
Existence of good large sets of Steiner triple systems. Discret. Math. 309(12): 3930-3935 (2009) - 2008
- [j3]Junling Zhou, Yanxun Chang, L. Ji:
The spectrum for large sets of pure Mendelsohn triple systems. Discret. Math. 308(10): 1850-1863 (2008) - 2006
- [j2]Junling Zhou:
Recursive constructions for large sets of resolvable hybrid triple systems. Australas. J Comb. 36: 113-122 (2006) - 2005
- [j1]Junling Zhou, Yanxun Chang:
Product constructions for large sets of resolvable MTSs and DTSs. Australas. J Comb. 33: 47-56 (2005)
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 2026-07-03 02:49 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
