40 citations · 165 across the 27 of their papers we have counts for
32 papers
From Linear Exact Repair to Mixed-Alphabet Codes: The Bandwidth-Subpacketization Tradeoff of MDS Array Codes
Zihao Zhang, Guodong Li, Sihuang Hu
MDS array codes achieve optimal storage efficiency in distributed storage systems, but their repair bandwidth depends critically on the sub-packetization level. While the theoretic…
ASM-6D: Fast Certified Pose-Shape Inference with Complete Correspondence Flow Maps
Ho Jin Choi, Minku Kim, Nadia Figueroa
Category-level 6D pose and shape estimation requires recovering an object's pose and geometry from partial observations without an exact instance model. We present ASM-6D, which co…
Improved bounds for constant-power and low-power error-correcting cooling codes
Tingting Tong, Sihuang Hu
Low-power error-correcting cooling (LPECC) codes and constant-power error-correcting cooling (CPECC) codes provide error correction while controlling power consumption and thermal…
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…
Divisibility of Trace Codes
Hexiang Huang, Haihua Deng, Sihuang Hu
A linear code is said to be -divisible if the Hamming weights of all its codewords are divisible by . The -adic valuation of a code is defined as the greatest integer …
3-Designs from -Invariant Subspaces of
Lewen Wang, Huawei Wu, Sihuang Hu
We present a uniform framework for constructing -designs from -invariant subspaces of , the space of homogeneous polynomials of d…
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…
Lower Bounds on Conversion Bandwidth for MDS Convertible Codes in Split Regime
Lewen Wang, Sihuang Hu
We propose several new lower bounds on the bandwidth costs of MDS convertible codes using a linear-algebraic framework. The derived bounds improve previous results in certain param…
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…
Constructing cooperative MSR codes with sub-packetization
Zihao Zhang, Guodong Li, Sihuang Hu
We address the multi-node failure repair challenges for MDS array codes. Presently, two primary models are employed for multi-node repairs: the centralized model where all failed n…
Optimal Locally Repairable Codes via Punctured Simplex Codes
Yuan Gao, Weijun Fang, Jingke Xu +2
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $…
MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
Guodong Li, Ningning Wang, Sihuang Hu +1
The sub-packetization and the field size are of paramount importance in the MSR array code constructions. For optimal-access MSR codes, Balaji et al. proved that $\ell\g…
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits
Guodong Li, Min Ye, Sihuang Hu
ABS polar codes were recently proposed to speed up polarization by swapping certain pairs of adjacent bits after each layer of polar transform. In this paper, we observe that apply…
Constructing MSR codes with subpacketization for helper nodes
Ningning Wang, Guodong Li, Sihuang Hu +1
Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an explicit construction of an Minimum Storage Regenerating (MSR) code with par…
All the codeword symbols in polar codes have the same SER under the SC decoder
Guodong Li, Min Ye, Sihuang Hu
We consider polar codes constructed from the kernel over a finite field , where is a power of a pr…
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization
Guodong Li, Min Ye, Sihuang Hu
The construction of polar codes with code length involves layers of polar transforms. In this paper, we observe that after each layer of polar transforms, one can swap…
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…
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes
Yan Xu, Changjiang Ji, Ran Tao +1
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller codes. By applying Construction to a chain of extended cyclic cod…
Relative projective group codes over chain rings
Simon Eisenbarth, Sihuang Hu
A structure theorem of the group codes which are relative projective for the subgroup of is given. With this, we show that all such relative projective grou…
Low dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16
Sihuang Hu, Gabriele Nebe
We classify the dual strongly perfect lattices in dimension 16. There are four pairs of such lattices, the famous Barnes-Wall lattice , the extremal 5-modular lattice $N_{1…
Strongly perfect lattices sandwiched between Barnes-Wall lattices
Sihuang Hu, Gabriele Nebe
New series of -dimensional universally strongly perfect lattices and are constructed with $$2BW_{2m} ^{\#} \subseteq Γ_J \subseteq BW_{2m} \subseteq Λ_I \subs…
A Bound on the Shannon Capacity via a Linear Programming Variation
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We show that our bound can outperform both the Lovász theta number and the Haemers mi…