default search action
Jing Jiang 0003
Person information
- affiliation: Guangxi Normal University, Guilin, China
Other persons with the same name
- Jing Jiang — disambiguation page
- Jing Jiang 0001
— Singapore Management University, School of Information Systems, Singapore (and 1 more)
- Jing Jiang 0002
- Jing Jiang 0004
- Jing Jiang 0005
- Jing Jiang 0006 — Texas Instruments Inc., USA (and 1 more)
- Jing Jiang 0007 — University of Illinois at Urbana-Champaign, Urbana, IL, USA
- Jing Jiang 0008 — China Agricultural University, Beijing, China
- Jing Jiang 0009 — Hangzhou Dianzi University, Hangzhou, China
- Jing Jiang 0010 — Texas A&M University, College Station, TX, USA
- Jing Jiang 0011 — Auckland University of Technology, New Zealand
- Jing Jiang 0012 — Qualcomm Technologies, Inc., Beijing, China
- Jing Jiang 0014 — Wayne State University, Detroit, MI, USA
- Jing Jiang 0015 — Air Force Early Warning Academy, Wuhan, Hubei, China
- Jing Jiang 0016
- Jing Jiang 0017
- Jing Jiang 0019 — Nanjing University of Posts and Telecommunications, China
- Jing Jiang 0020 — NPC Beijing Richfit Information Technology Co., Ltd., Beijing, China
- Jing Jiang 0021
- Jing Jiang 0022 — Chongqing University of Arts and Sciences, China
- Jing Jiang 0023 — Shanghai Jiao Tong University, Shanghai, China
- Jing Jiang 0024 — Wuhan University of Technology, Wuhan, Hubei, China
- Jing Jiang 0025 — Bank of Communications, Shanghai, China
- Jing Jiang 0026
- Jin Jiang 0001
- Jing Jiang 0028 — Northeastern University, Shenyang, China
- Jing Jiang 0029 — Stanford University, CA, USA
- Jing Jiang 0030 — State Power Economic Research Institute of State Grid Corporation of China, Beijing, China
- Jing Jiang 0031
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Jing Jiang
Constructions of t-strongly multimedia IPP codes with length t+1. Des. Codes Cryptogr. 92(10): 2949-2970 (2024) - 2023
- [j19]Cailin Wen, Jing Jiang
2¯-separable codes with length 5. Discret. Math. 346(8): 113466 (2023) - [c5]Jing Jiang, Yuqing Xiao:
Coded Distributed Computing Schemes with Fewer Files. ICCCS 2023: 851-855 - 2022
- [j18]Jing Jiang
Cascaded Coded Distributed Computing Schemes Based on Symmetric Designs. IEEE Trans. Commun. 70(11): 7179-7190 (2022) - [c4]Jing Jiang, Lingling Zhou, Lingxiao Qu:
Coded Distributed Computing Schemes via Grouping Method. ICCAI 2022: 98-103 - 2020
- [j17]Minquan Cheng
Some New Coded Caching Schemes With Smaller Subpacketization via Some Known Results. IEEE Access 8: 86305-86315 (2020) - [j16]Jing Jiang
Cascaded Coded Distributed Computing Schemes Based on Placement Delivery Arrays. IEEE Access 8: 221385-221395 (2020) - [j15]Jing Jiang
Regular (k, R, 1)-packings with $\max \limits {(R)}=3$ and their locally repairable codes. Cryptogr. Commun. 12(6): 1071-1089 (2020) - [j14]Jing Jiang
Multimedia IPP codes with efficient tracing. Des. Codes Cryptogr. 88(5): 851-866 (2020) - [j13]Xi Zhong, Minquan Cheng
Placement Delivery Array Based on Concatenating Construction. IEEE Commun. Lett. 24(6): 1216-1220 (2020) - [j12]Minquan Cheng
Some Variant of Known Coded Caching Schemes With Good Performance. IEEE Trans. Commun. 68(3): 1370-1377 (2020) - [i11]Jing Jiang, Lingxiao Qu:
Coded Distributed Computing Schemes with Smaller Numbers of Input Files and Output Functions. CoRR abs/2001.04194 (2020)
2010 – 2019
- 2019
- [j11]Minquan Cheng
Improved bounds on 2-frameproof codes with length 4. Des. Codes Cryptogr. 87(1): 97-106 (2019) - [j10]Minquan Cheng
A Generalized Grouping Scheme in Coded Caching. IEEE Trans. Commun. 67(5): 3422-3430 (2019) - [j9]Minquan Cheng
Constructions of Coded Caching Schemes With Flexible Memory Size. IEEE Trans. Commun. 67(6): 4166-4176 (2019) - [c3]Jing Jiang, Chengyao Zhao, Minquan Cheng, Hongyan Dong:
Combinatorial Properties of Multimedia IPP Codes of Length 2. DASC/PiCom/DataCom/CyberSciTech 2019: 930-935 - 2018
- [j8]Xuli Zhang, Jing Jiang, Minquan Cheng:
Bounds and constructions for 3¯-strongly separable codes with length 3. Cryptogr. Commun. 10(3): 555-565 (2018) - [c2]Minquan Cheng, Qiaoling Zhang, Jing Jiang, Ruizhong Wei:
Reduced Transmission in Multi-server Coded Caching. IDCS 2018: 75-86 - [i10]Minquan Cheng, Qiaoling Zhang, Jing Jiang:
Improved rate for a multi-server coded caching. CoRR abs/1802.07410 (2018) - 2017
- [j7]Minquan Cheng, Jing Jiang, Xiaohu Tang:
Asymptotically optimal 2¯-separable codes with length 4. Cryptogr. Commun. 9(3): 397-405 (2017) - [j6]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo
Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83(1): 71-82 (2017) - [i9]Minquan Cheng, Qifa Yan, Xiaohu Tang, Jing Jiang:
Optimal Placement Delivery Arrays with Minimum Number of Rows. CoRR abs/1703.01548 (2017) - [i8]Minquan Cheng, Jing Jiang, Qifa Yan, Xiaohu Tang:
Coded caching schemes for Flexible Memory Sizes. CoRR abs/1708.06650 (2017) - [i7]Minquan Cheng, Jing Jiang, Youzhi Yao:
A Novel Recursive Construction for Coded Caching Schemes. CoRR abs/1712.09090 (2017) - 2016
- [j5]Jing Jiang, Minquan Cheng, Ying Miao:
Strongly separable codes. Des. Codes Cryptogr. 79(2): 303-318 (2016) - [j4]Minquan Cheng, Jing Jiang, Haiyan Li, Ying Miao, Xiaohu Tang:
Bounds and constructions for 3¯-separable codes with length 3. Des. Codes Cryptogr. 81(2): 317-335 (2016) - [i6]Minquan Cheng, Jing Jiang, Qifa Yan, Xiaohu Tang, Haitao Cao:
Optimal Placement Delivery Arrays. CoRR abs/1611.04213 (2016) - [i5]Xuli Zhang, Jing Jiang, Minquan Cheng:
Bounds and Constructions for $\overline{3}$-Strongly Separable Codes with Length $3$. CoRR abs/1611.04349 (2016) - 2015
- [j3]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo
New bounds on 2-separable codes of length 2. Des. Codes Cryptogr. 74(1): 31-40 (2015) - [i4]Minquan Cheng, Jing Jiang, Haiyan Li, Ying Miao, Xiaohu Tang:
Bounds and Constructions for $\overline{3}$-Separable Codes with Length 3. CoRR abs/1507.00954 (2015) - 2014
- [i3]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
Codes with the Identifiable Parent Property for Multimedia Fingerprinting. CoRR abs/1411.6784 (2014) - [i2]Jing Jiang, Minquan Cheng, Ying Miao, Dianhua Wu:
Multimedia IPP Codes with Efficient Tracing. CoRR abs/1411.6841 (2014) - [i1]Jing Jiang, Minquan Cheng, Ying Miao:
Strongly Separable Codes. CoRR abs/1412.6128 (2014) - 2013
- [j2]Jing Jiang, Dianhua Wu, Moon Ho Lee:
Some Infinite Classes of Optimal (v, {3, 4}, 1, Q)-OOCs with $${Q \in \{(\frac {1}{3}, \frac {2}{3}), (\frac {2}{3}, \frac{1}{3})\}}$$. Graphs Comb. 29(6): 1795-1811 (2013) - 2012
- [j1]Jing Jiang, Dianhua Wu, Pingzhi Fan:
General Constructions for (υ, 4, 1) Optical Orthogonal Codes via Perfect Difference Families. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(11): 1921-1925 (2012) - 2011
- [c1]Jing Jiang, Dianhua Wu, Pingzhi Fan:
More results on optimal optical orthogonal codes with weight four. IWSDA 2011: 122-125
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-12-23 19:34 CET 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: