4 citations · 4 across the 12 of their papers we have counts for
12 papers
Optimal Exponent of the Single-Error Correction Threshold with Fixed Redundancy for Analog Error-Correcting Codes
Zhengyi Jiang, Wenhao Liu, Zhongyi Huang +1
Analog error-correcting codes (Analog ECCs), introduced by Roth [1], address errors in vector-matrix multiplication arising from analog noise and sparse outliers in in-memory compu…
Asymptotically Optimal Codes for Correcting Burst Deletions and Insertions in Labeled DNA Sequences
Wenhao Liu, Zhengyi Jiang, Zhongyi Huang +1
Fluorescent labeling is a cornerstone of DNA visualization and a key enabler of random access in DNA-based data storage. However, the stochastic nature of biochemical processes, in…
Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes
Zhengyi Jiang, Wenhao Liu, Zhongyi Huang +3
Analog error-correcting codes (Analog ECCs) for approximate vector-matrix multiplication have been extensively studied as means to achieve fault-tolerant in-memory computation. The…
Joint Design of Piggyback and Conjugate Transformation Functions for Repair Bandwidth Reduction in Piggybacking Codes
Hao Shi, Zhengyi Jiang, Gefeng Deng +2
Efficient node repair is a central requirement in distributed storage systems, particularly in high-rate erasure-coded deployments where repair traffic directly affects network ove…
Redundancy-Optimal Constructions of -Criss-Cross Deletion Correcting Codes with Efficient Encoding/Decoding Algorithms
Wenhao Liu, Zhengyi Jiang, Zhongyi Huang +1
Two-dimensional error-correcting codes, where codewords are represented as arrays over a -ary alphabet, find important applications in areas such as QR codes, DNA-b…
Grid-like Error-Correcting Codes for Matrix Multiplication with Better Correcting Capability
Hao Shi, Zhengyi Jiang, Zhongyi Huang +3
Matrix multiplication over the real field constitutes a foundational operation in the training of deep learning models, serving as a computational cornerstone for both forward and…
Accelerating Data Access for Single Node in Distributed Storage Systems via MDS Codes
Hao Shi, Zhengyi Jiang, Zhongyi Huang +2
Maximum distance separable (MDS) array codes are widely employed in modern distributed storage systems to provide high data reliability with small storage overhead. Compared with t…
Error Correction Decoding Algorithms of RS Codes Based on An Earlier Termination Algorithm to Find The Error Locator Polynomial
Zhengyi Jiang, Hao Shi, Zhongyi Huang +4
Reed-Solomon (RS) codes are widely used to correct errors in storage systems. Finding the error locator polynomial is one of the key steps in the error correction procedure of RS c…
Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization
Hao Shi, Zhengyi Jiang, Zhongyi Huang +3
Maximum distance separable (MDS) codes facilitate the achievement of elevated levels of fault tolerance in storage systems while incurring minimal redundancy overhead. Reed-Solomon…
Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity
Wenhao Liu, Zhengyi Jiang, Zhongyi Huang +2
Reed-Solomon (RS) codes are constructed over a finite field that have been widely employed in storage and communication systems. Many fast encoding/decoding algorithms such as fast…
Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance
Zhengyi Jiang, Hao Shi, Zhongyi Huang +3
Maximum distance separable (MDS) codes have the optimal trade-off between storage efficiency and fault tolerance, which are widely used in distributed storage systems. As typical n…
Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth
Hao Shi, Zhengyi Jiang, Zhongyi Huang +2
As a special class of array codes, piggybacking codes are MDS codes (i.e., any out of nodes can retrieve all data symbols) that can achieve low repair bandwidth f…