default search action
Jianmin Wang 0003
Person information
- affiliation: Suzhou University, Department of Mathematics, China
Other persons with the same name
- Jianmin Wang (aka: Jian-Min Wang) — disambiguation page
- Jianmin Wang 0001 (aka: Jian-min Wang 0001) — Tsinghua University, School of Software, Beijing, China
- Jianmin Wang 0004 — Harbin University of Science and Technology, China
- Jianmin Wang 0005 — Shandong University, China
- Jianmin Wang 0006 — Zhongsang University, Guangzhou, China
- Jianmin Wang 0007 — Hunan University of Commerce, Changsha, China
- Jianmin Wang 0008 — Iowa State University, Ames, Iowa, USA
- Jianmin Wang 0009 — Xiamen University, China
- Jianmin Wang 0010 — Beijing Normal University, State Key Laboratory of Earth Surface Processes and Resource Ecology, China
- Jianmin Wang 0011 — National Formosa University, Department of Vehicle Engineering, Yunlin, Taiwan
- Jianmin Wang 0012 — Hefei University of Technology, Hefei, China
- Jianmin Wang 0013 (aka: Jian-Min Wang 0013) — Tongji University, Car Interaction Design Lab, College of Arts and Media, Shanghai, China (and 1 more)
- Jianmin Wang 0014 — Roswell Park Cancer Institute, Buffalo, NY, USA
- Jianmin Wang 0015 — Chinese Academy of Sciences, Technology and Engineering Center for Space Utilization, Beijing, China
- Jianmin Wang 0016 — Hunan University, School of Computer Science and Engineering, Changsha, China (and 1 more)
- Jianmin Wang 0017 (aka: Jian-Min Wang 0017) — Chinese Culture University, Department of Information Management, Taipei, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j9]Peipei Dai, Jianmin Wang, Jianxing Yin:
Two series of equitable symbol weight codes meeting the Plotkin bound. Des. Codes Cryptogr. 74(1): 15-29 (2015) - 2014
- [j8]Peipei Dai, Jianmin Wang, Jianxing Yin:
Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property. Des. Codes Cryptogr. 71(2): 315-330 (2014) - 2012
- [j7]Kun Wang, Jianmin Wang:
Semicyclic 4-GDDs and related two-dimensional optical orthogonal codes. Des. Codes Cryptogr. 63(3): 305-319 (2012) - 2011
- [j6]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
- [j5]Jianmin Wang, Xiuling Shan, Jianxing Yin:
On constructions for optimal two-dimensional optical orthogonal codes. Des. Codes Cryptogr. 54(1): 43-60 (2010) - [j4]Jianmin Wang, Jianxing Yin:
Two-dimensional optical orthogonal codes and semicyclic group divisible designs. IEEE Trans. Inf. Theory 56(5): 2177-2187 (2010)
2000 – 2009
- 2009
- [j3]Bin Wen, Jianmin Wang, Jianxing Yin:
Optimal grid holey packings with block size 3 and 4. Des. Codes Cryptogr. 52(1): 107-124 (2009) - 2008
- [j2]Jianmin Wang:
Some combinatorial constructions for optimal perfect deletion-correcting codes. Des. Codes Cryptogr. 48(3): 331-347 (2008) - 2002
- [j1]Nabil Shalaby, Jianmin Wang, Jianxing Yin:
Existence of Perfect 4-Deletion-Correcting Codes with Length Six. Des. Codes Cryptogr. 27(1-2): 145-156 (2002)
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-25 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint