research
∙
09/20/2022
Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth
As a special class of array codes, (n,k,m) piggybacking codes are MDS co...
share
research
∙
09/12/2022
On MDS Condition and Erased Lines Recovery of Generalized Expanded-Blaum-Roth Codes and Generalized Blaum-Roth Codes
Generalized Expanded-Blaum-Roth (GEBR) codes [1] are designed for large-...
research
∙
05/29/2022
Two New Piggybacking Designs with Lower Repair Bandwidth
Piggybacking codes are a special class of MDS array codes that can achie...
research
∙
10/10/2021
A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding
A maximum distance separable (MDS) array code is composed of m× (k+r) ar...
research
∙
05/25/2020
Update Bandwidth for Distributed Storage
In this paper, we consider the update bandwidth in distributed storage s...
research
∙
05/15/2020
Network Coding Based on Byte-wise Circular Shift and Integer Addition
A novel implementation of a special class of Galois ring, in which the m...
research
∙
07/21/2019
Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization
An (n,k) maximum distance separable (MDS) code has optimal repair access...
research
∙
09/12/2018
Binary MDS Array Codes with Optimal Repair
Consider a binary maximum distance separate (MDS) array code composed of...
research
∙
09/08/2018
Delay-Constrained Input-Queued Switch
In this paper, we study the delay-constrained input-queued switch where ...
research
∙
03/09/2018
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding
Array codes have been widely employed in storage systems, such as Redund...
research
∙
02/12/2018