Zhengyi Jiang

Orcid: 0000-0002-2060-1108

Affiliations:
  • Huawei Technologies Company Ltd., Central Research Institute, China
  • Tsinghua University, Department of Mathematics Sciences, Beijing, China


According to our database1, Zhengyi Jiang authored at least 29 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes.
CoRR, May, 2026

Joint Design of Piggyback and Conjugate Transformation Functions for Repair Bandwidth Reduction in Piggybacking Codes.
CoRR, May, 2026

Redundancy-Optimal Constructions of (1,1)-Criss-Cross Deletion Correcting Codes with Efficient Encoding/Decoding Algorithms.
CoRR, February, 2026

Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT.
IEEE Trans. Commun., 2026

Cross-Rack Update Bandwidth for Rack-Aware Storage Systems.
IEEE Trans. Commun., 2026

2025
Piggybacking+ Codes: MDS Array Codes Over Small Fields to Achieve Lower Repair Bandwidth.
IEEE Trans. Commun., November, 2025

Explicit Constructions of Rack-Aware Regenerating Codes for Multi-Node Failures.
IEEE Trans. Commun., October, 2025

Error Correction Decoding Algorithms of RS Codes Based on an Earlier Termination Algorithm to Find the Error Locator Polynomial.
IEEE Trans. Inf. Theory, April, 2025

Accelerating Data Access for Single Node in Distributed Storage Systems via MDS Codes.
CoRR, January, 2025

Grid-Like Error-Correcting Codes for Matrix Multiplication with Better Correcting Capability.
Proceedings of the IEEE Information Theory Workshop, 2025

New Piggybacking Codes for Efficient Repair of Single-Node and Double-Node Erasures.
Proceedings of the IEEE International Symposium on Information Theory, 2025

Constructions of Analog Error-Correcting Codes for Single-Error Detection and Correction with Efficient Decoding Algorithm.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2024
Generalized Simple Regenerating Codes: Trading Sub-Packetization and Fault Tolerance.
IEEE Trans. Commun., December, 2024

Toward Lower Repair Bandwidth and Optimal Repair Complexity of Piggybacking Codes With Small Sub-Packetization.
IEEE Trans. Commun., September, 2024

Conjugate-Piggybacking Codes: MDS Array Codes with Lower Repair Bandwidth over Small Field Size.
Proceedings of the IEEE Information Theory Workshop, 2024

On the I/O Cost of Linear Repair Schemes for Arbitrary $(n,k)$ Reed-Solomon Codes.
Proceedings of the IEEE Information Theory Workshop, 2024

New Reed-Solomon Codes with All XOR Operation for Better En/Decoding Performance.
Proceedings of the IEEE Information Theory Workshop, 2024

Set Transformation: Trade-Off Between Repair Bandwidth and Sub-Packetization.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit Constructions.
Proceedings of the IEEE International Symposium on Information Theory, 2024

An Earlier Termination Algorithm to Find Error Locator Polynomial in Error Correction of RS Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Product-Matrix Construction of Minimum Storage Rack-aware Regenerating Codes.
Proceedings of the International Conference on Wireless Communications and Signal Processing, 2023

Piggybacking+ Codes: MDS Array Codes with Linear Sub- Packetization to Achieve Lower Repair Bandwidth.
Proceedings of the IEEE Global Communications Conference, 2023

Cross-Rack Update Bandwidth for Distributed Storage Systems.
Proceedings of the IEEE Global Communications Conference, 2023

Toward Lower Repair Bandwidth of Piggybacking Codes via Jointly Design for Both Data and Parity Nodes.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth.
CoRR, 2022

Two New Piggybacking Designs with Lower Repair Bandwidth.
CoRR, 2022

New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node Failure.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization.
Proceedings of the IEEE International Symposium on Information Theory, 2021


  Loading...