98 citations · 219 across the 62 of their papers we have counts for
73 papers
Multiple-Function Approximated Coded Computing: Constructions and Error Bounds
Rimpi Borah, Wilton Kim, J. Harshan +2
Coded computing mitigates stragglers in distributed computation. While Lagrange coded computing (LCC) enables exact polynomial computation over finite fields, Berrut approximated c…
Constant-List Insertion--Deletion Codes:New Bounds and an Improvement of Levenshtein's Lower Bound
Han Mao Kiah, Hengjia Wei, Ruixiao Zeng
We study codes correcting adversarial insertions and deletions with list size fixed independently of the block length. We derive new achievable-rate bounds for binary codes and…
Robust Repair of Reed-Solomon Codes
Wilton Kim, Stanislav Kruglik, Gaojun Luo +1
We study the problem of robust repair of a single erasure in Reed--Solomon codes under low communication bandwidth. Focusing on the Guruswami--Wootters trace repair framework, we i…
Expected Recovery Time in DNA-based Distributed Storage Systems
Adi Levy, Roni Con, Eitan Yaakobi +1
We initiate the study of DNA-based distributed storage systems, where information is encoded across multiple DNA data storage containers to achieve robustness against container fai…
Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
Shubhransh Singhvi, Han Mao Kiah, Eitan Yaakobi
The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a communication setting in which a sender transmits a codeword and the receiver observes K indepen…
Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
Wenqin Zhang, Han Mao Kiah, Son Hoang Dau
We revisit zigzag array codes, a family of MDS codes known for achieving optimal access and optimal rebuilding ratio in single-node repair. In this work, we endow zigzag codes with…