Jing Jiang

Orcid: 0000-0002-1942-3834

Affiliations:
  • Guangxi Normal University, Guilin, China


According to our database1, Jing Jiang authored at least 33 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
2¯-separable codes with length 5.
Discret. Math., August, 2023

Coded Distributed Computing Schemes with Fewer Files.
Proceedings of the 8th International Conference on Computer and Communication Systems, 2023

2022
Cascaded Coded Distributed Computing Schemes Based on Symmetric Designs.
IEEE Trans. Commun., 2022

Coded Distributed Computing Schemes via Grouping Method.
Proceedings of the ICCAI '22: 8th International Conference on Computing and Artificial Intelligence, Tianjin, China, March 18, 2022

2020
Some Variant of Known Coded Caching Schemes With Good Performance.
IEEE Trans. Commun., 2020

Placement Delivery Array Based on Concatenating Construction.
IEEE Commun. Lett., 2020

Multimedia IPP codes with efficient tracing.
Des. Codes Cryptogr., 2020

Coded Distributed Computing Schemes with Smaller Numbers of Input Files and Output Functions.
CoRR, 2020

Regular (k, R, 1)-packings with $\max \limits {(R)}=3$ and their locally repairable codes.
Cryptogr. Commun., 2020

Cascaded Coded Distributed Computing Schemes Based on Placement Delivery Arrays.
IEEE Access, 2020

Some New Coded Caching Schemes With Smaller Subpacketization via Some Known Results.
IEEE Access, 2020

2019
Constructions of Coded Caching Schemes With Flexible Memory Size.
IEEE Trans. Commun., 2019

A Generalized Grouping Scheme in Coded Caching.
IEEE Trans. Commun., 2019

Improved bounds on 2-frameproof codes with length 4.
Des. Codes Cryptogr., 2019

Combinatorial Properties of Multimedia IPP Codes of Length 2.
Proceedings of the 2019 IEEE Intl Conf on Dependable, 2019

2018
Improved rate for a multi-server coded caching.
CoRR, 2018

Bounds and constructions for 3¯-strongly separable codes with length 3.
Cryptogr. Commun., 2018

Reduced Transmission in Multi-server Coded Caching.
Proceedings of the Internet and Distributed Computing Systems, 2018

2017
Codes with the identifiable parent property for multimedia fingerprinting.
Des. Codes Cryptogr., 2017

A Novel Recursive Construction for Coded Caching Schemes.
CoRR, 2017

Coded caching schemes for Flexible Memory Sizes.
CoRR, 2017

Optimal Placement Delivery Arrays with Minimum Number of Rows.
CoRR, 2017

Asymptotically optimal 2¯-separable codes with length 4.
Cryptogr. Commun., 2017

2016
Strongly separable codes.
Des. Codes Cryptogr., 2016

Bounds and constructions for 3¯-separable codes with length 3.
Des. Codes Cryptogr., 2016

Bounds and Constructions for $\overline{3}$-Strongly Separable Codes with Length $3$.
CoRR, 2016

Optimal Placement Delivery Arrays.
CoRR, 2016

2015
New bounds on 2-separable codes of length 2.
Des. Codes Cryptogr., 2015

Bounds and Constructions for $\overline{3}$-Separable Codes with Length 3.
CoRR, 2015

2014
Multimedia IPP Codes with Efficient Tracing.
CoRR, 2014

2013
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., 2013

2012
General Constructions for (υ, 4, 1) Optical Orthogonal Codes via Perfect Difference Families.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

2011
More results on optimal optical orthogonal codes with weight four.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011


  Loading...