Xing Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xing Lin has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Xiaohu Tang
Southwest Jiaotong University
3 shared publications - Han Cai
Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, China
2 shared publications Deyong He
Univ. of Science and Technology of China (China)
1 shared publication- Guang-Can Guo
Laboratory of Quantum Information, University of Science and Technology of China, Hefei 230026, China
1 shared publication Guanjie Fanyuan
Univ. of Science and Technology of China (China)
1 shared publicationHaiou Zhang
1 shared publication
Latest Publications
- 3 January 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 507-524
$(1+\epsilon )$-optimal MDS codes: contacting any set of helper nodes smaller than $n-1$- 3 January 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 507-524
$(1+\epsilon )$-optimal MDS codes: contacting any set of helper nodes smaller than $n-1$- 3 November 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 367-393
Distributed repairing multiple erasures in Reed-Solomon codes
- 3 November 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 367-393
Distributed repairing multiple erasures in Reed-Solomon codes
- 16 October 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 315-327
Explicit constructions of optimal vector locally repairable codes
- 16 October 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 315-327
Explicit constructions of optimal vector locally repairable codes
- 3 July 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-20
Distributed repair schemes for Reed–Solomon codes with multiple erasures
- 3 July 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-20
Distributed repair schemes for Reed–Solomon codes with multiple erasures
- 29 November 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (2) , 377-396
A new repair-efficient piggybacking design for systematic nodes
- 29 November 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (2) , 377-396
A new repair-efficient piggybacking design for systematic nodes
- Open Access
- 26 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Distributed Repair Schemes for Reed-Solomon Codes With Multiple Erasures
The use of Reed-Solomon (RS) codes in distributed storage systems is ubiquitous. In recent years, the repair schemes for RS codes with one or multiple failed symbols that can lessen communication cost in the repair (i.e., repair bandwidth) have been presented in literatures. However, the existing distributed repair schemes of RS codes can only repair e = 2, 3 erasures. In this paper, by ingeniously constructing the trace polynomials, two distributed repair schemes for RS codes with e ≥ 4 erasures are proposed for the first time.
- 26 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessDistributed Repair Schemes for Reed-Solomon Codes With Multiple Erasures
The use of Reed-Solomon (RS) codes in distributed storage systems is ubiquitous. In recent years, the repair schemes for RS codes with one or multiple failed symbols that can lessen communication cost in the repair (i.e., repair bandwidth) have been presented in literatures. However, the existing distributed repair schemes of RS codes can only repair e = 2, 3 erasures. In this paper, by ingeniously constructing the trace polynomials, two distributed repair schemes for RS codes with e ≥ 4 erasures are proposed for the first time.
- Open Access
- 26 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Distributed Repairing Multiple Erasures in Reed-Solomon Codes
The application of Reed-Solomon (RS) codes in distributed storage systems is widespread. A lot of literature have proposed repair schemes for RS codes with one or multiple failed symbols, which can reduce communication cost during repair (i.e. repair bandwidth). However, for repair schemes of RS codes with multiple failed symbols, the existing distributed repair schemes can only repair e = 2, 3 erasures. In this paper, by intelligently dividing the set of evaluation points corresponding to failed symbols, a distributed repair scheme for RS codes with e ≥ 4 erasures are proposed.
- 26 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessDistributed Repairing Multiple Erasures in Reed-Solomon Codes
The application of Reed-Solomon (RS) codes in distributed storage systems is widespread. A lot of literature have proposed repair schemes for RS codes with one or multiple failed symbols, which can reduce communication cost during repair (i.e. repair bandwidth). However, for repair schemes of RS codes with multiple failed symbols, the existing distributed repair schemes can only repair e = 2, 3 erasures. In this paper, by intelligently dividing the set of evaluation points corresponding to failed symbols, a distributed repair scheme for RS codes with e ≥ 4 erasures are proposed.
- Open Access
- 26 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Repair Schemes of Rack-Aware Reed-Solomon Codes: Providing A Tradeoff Between the Sub-Packetization Size and the Cross-Rack Repair Bandwidth
In practical data centers, storage nodes are grouped and distributed in different racks, where the communication cost across racks is much more expensive than that within rack. The concept of rack-aware maximum distance separable (MDS) codes has been put forward in recent literatures to deal with rack architecture. In this paper, the cross-rack repair bandwidth and sub-packetization size of rack-aware Reed-Solomon (RS) codes are studied. Cross-rack repair bandwidth is defined as the amount of information transmitted between the racks in the repair process of a failed node. RS codes can be regarded as polynomials over a finite field $GF(q^t)$ evaluated at a set of points, where $t$ is referred to as the sub-packetization size. Smaller cross-rack repair bandwidth decreases the network usage in data centers, and smaller sub-packetization size is conducive to the implementation of RS code with lower complexity. Previous RS codes that reach the rack-aware cut-set bound on cross-rack repair bandwidth either have sub-packetization size exponential in the code length or require strictly limited parameter conditions. In this paper, the lower bound on the cross-rack repair bandwidth related to sub-packetization size for rack-aware RS codes is given, which is asymptotically reachable under some parameters, and three repair schemes of rack-aware RS codes which provide a tradeoff between the sub-packetization size and the cross-rack repair bandwidth are shown.- 26 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessRepair Schemes of Rack-Aware Reed-Solomon Codes: Providing A Tradeoff Between the Sub-Packetization Size and the Cross-Rack Repair Bandwidth
In practical data centers, storage nodes are grouped and distributed in different racks, where the communication cost across racks is much more expensive than that within rack. The concept of rack-aware maximum distance separable (MDS) codes has been put forward in recent literatures to deal with rack architecture. In this paper, the cross-rack repair bandwidth and sub-packetization size of rack-aware Reed-Solomon (RS) codes are studied. Cross-rack repair bandwidth is defined as the amount of information transmitted between the racks in the repair process of a failed node. RS codes can be regarded as polynomials over a finite field $GF(q^t)$ evaluated at a set of points, where $t$ is referred to as the sub-packetization size. Smaller cross-rack repair bandwidth decreases the network usage in data centers, and smaller sub-packetization size is conducive to the implementation of RS code with lower complexity. Previous RS codes that reach the rack-aware cut-set bound on cross-rack repair bandwidth either have sub-packetization size exponential in the code length or require strictly limited parameter conditions. In this paper, the lower bound on the cross-rack repair bandwidth related to sub-packetization size for rack-aware RS codes is given, which is asymptotically reachable under some parameters, and three repair schemes of rack-aware RS codes which provide a tradeoff between the sub-packetization size and the cross-rack repair bandwidth are shown. - 19 March 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (7)
On singleton-type bound of locally repairable codes
- 19 March 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (7)
On singleton-type bound of locally repairable codes
- 27 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (11) , 2924-2927
A Note on Bandwidth-Optimal Repair Scheme for Reed-Solomon Codes With Low Repair Locality
Reed-Solomon codes can be regarded as polynomials over a finite field GF(qt) evaluated at a set of points, where t is referred to as the sub-packetization size. In this letter, for the small sub-packetization size regime, we show a bandwidth-optimal linear repair scheme of single failed symbol for Reed-Solomon codes with repair locality smaller than n -1 for the first time, where repair locality refers to the number of the surviving symbols involved in the repair and n means the code length.
- 27 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (11) , 2924-2927
A Note on Bandwidth-Optimal Repair Scheme for Reed-Solomon Codes With Low Repair Locality
Reed-Solomon codes can be regarded as polynomials over a finite field GF(qt) evaluated at a set of points, where t is referred to as the sub-packetization size. In this letter, for the small sub-packetization size regime, we show a bandwidth-optimal linear repair scheme of single failed symbol for Reed-Solomon codes with repair locality smaller than n -1 for the first time, where repair locality refers to the number of the surviving symbols involved in the repair and n means the code length.