6 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…
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…
Trace Repair Never Loses to Classical Repair: Exact and Explicit Helper Nodes Selection
Wilton Kim, Stanislav Kruglik, Han Mao Kiah
Repairing Reed-Solomon codes with low bandwidth is a central challenge in distributed storage. Following the trace-repair framework of Guruswami and Wootters (2017), recent works b…
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes
Stanislav Kruglik, Gaojun Luo, Wilton Kim +4
We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we co…
Verifiable Coded Computation of Multiple Functions
Wilton Kim, Stanislav Kruglik, Han Mao Kiah
We consider the problem of evaluating distinct multivariate polynomials over several massive datasets in a distributed computing system with a single master node and multiple worke…
Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols
Han Mao Kiah, Wilton Kim, Stanislav Kruglik +2
Motivated by applications in distributed storage, distributed computing, and homomorphic secret sharing, we study communication-efficient schemes for computing linear combinations…