Jie Li

Orcid: 0000-0002-7582-7630

Affiliations:
  • Huawei Technologies, Hong Kong
  • Aalto University, Espoo, Finnland (2019-2021)
  • Hubei University, Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Wuhan, China
  • Southwest Jiaotong University, Information Security and National Computing Grid Laboratory, Chengdu, China (PhD 2017)


According to our database1, Jie Li authored at least 39 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Digital Twin Empowered Industrial IoT Based on Credibility-Weighted Swarm Learning.
IEEE Trans. Ind. Informatics, January, 2024

2023
MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees.
IEEE Trans. Commun., October, 2023

A Generic Transformation to Enable Optimal Repair/Access MDS Array Codes With Multiple Repair Degrees.
IEEE Trans. Inf. Theory, July, 2023

PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access.
IEEE Trans. Inf. Theory, March, 2023

Information-Theoretically Private Matrix Multiplication From MDS-Coded Storage.
IEEE Trans. Inf. Forensics Secur., 2023

MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees.
CoRR, 2023

2022
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers.
IEEE Trans. Inf. Theory, 2022

Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers.
IEEE Trans. Inf. Forensics Secur., 2022

A Generic Transformation to Generate MDS Array Codes With δ-Optimal Access Property.
IEEE Trans. Commun., 2022

A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F<sub>2</sub>.
IEEE Trans. Commun., 2022

Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR.
IEEE J. Sel. Areas Commun., 2022

Optimal Repair/Access MDS Array Codes with Multiple Repair Degrees.
CoRR, 2022

Private Matrix Multiplication From MDS-Coded Storage With Colluding Servers.
CoRR, 2022

PMDS Array Codes With Small Sub-packetization Level and Small Repair Bandwidth.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth.
IEEE Trans. Inf. Theory, 2021

Linear Coded Caching Scheme for Centralized Networks.
IEEE Trans. Inf. Theory, 2021

A Generic Transformation to Generate MDS Storage Codes with δ-Optimal Access Property.
CoRR, 2021

Improved Private and Secure Distributed (Batch) Matrix Multiplication.
CoRR, 2021

Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR.
CoRR, 2021

Improved Private and Secure Distributed Matrix Multiplication.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Towards Practical Private Information Retrieval From MDS Array Codes.
IEEE Trans. Commun., 2020

2019
Private Information Retrieval from MDS Array Codes with (Near-) Optimal Repair Bandwidth.
CoRR, 2019

A Note on the Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems.
CoRR, 2019

Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2018

Explicit Constructions of High-Rate MSR Codes With Optimal Access Property Over Small Finite Fields.
IEEE Trans. Commun., 2018

An Alternative Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Optimal Exact Repair Strategy for the Parity Nodes of the (k+2, k) Zigzag Code.
IEEE Trans. Inf. Theory, 2016

Hadamard Minimum Storage Regenerating Code Revisited.
IEEE Commun. Lett., 2016

A New Construction of (k+2, k) Minimal Storage Regenerating Code Over F<sub>3</sub> With Optimal Access Property for All Nodes.
IEEE Commun. Lett., 2016

Enabling All-Node-Repair in Minimum Storage Regenerating Codes.
CoRR, 2016

2015
A Systematic Piggybacking Design for Minimum Storage Regenerating Codes.
IEEE Trans. Inf. Theory, 2015

A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2015

A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property.
IEEE Trans. Inf. Theory, 2015

New repair strategy of Hadamard minimum storage regenerating code for distributed storage system.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

2013
A Generic Construction of Generalized Chirp-Like Sequence Sets with Optimal Zero Correlation Property.
IEEE Commun. Lett., 2013

A family of quadriphase sequences of period 4(2 n - 1) with low correlation and large linear span.
Des. Codes Cryptogr., 2013

A Framework of Constructions of Minimum Storage Regenerating Codes with the Optimal Update/Access Property for Distributed Storage Systems Based on Invariant Subspace Technique.
CoRR, 2013


  Loading...