8 papers
Duality and Reverse Self-Dual Constructions for Hyperderivative Reed-Solomon Codes
Hongchang Li, Zhihao Zhu, Weijun Fang +2
Hyperderivative Reed-Solomon (HRS) codes form a class of maximum-distance-separable codes under the Niederreiter-Rosenbloom-Tsfasman metric and may be viewed as a derivative-evalua…
Making Wide Stripes Practical: Cascaded Parity LRCs for Efficient Repair and High Reliability
Fan Yu, Guodong Li, Si Wu +2
Erasure coding with wide stripes is increasingly adopted to reduce storage overhead in large-scale storage systems. However, existing Locally Repairable Codes (LRCs) exhibit struct…
Optimal Repair of MDS Array Codes
Zihao Zhang, Guodong Li, Sihuang Hu
Maximum distance separable (MDS) codes are widely used in distributed storage systems as they provide optimal fault tolerance for a given amount of storage overhead. The seminal wo…
Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
Sihuang Hu, Hexiang Huang, Wei-Hsuan Yu
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamm…
Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
Lewen Wang, Zihao Zhang, Sihuang Hu
We establish lower bounds on the sub-packetization of optimal-access MSR codes in the context of multiple-node failures. These bounds generalize the tight bounds for single-node fa…
A Dynamic Programming Method to Construct Polar Codes with Improved Performance
Guodong Li, Min Ye, Sihuang Hu
In the standard polar code construction, the message vector is divided into information bits and frozen bits according to the reliability of each gi…