7 papers
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…
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…
Bounds on Codes Correcting Adjacent Transpositions
Mladen KovaÄeviÄ, Mladen Kovačević, Keshav Goyal +1
We study the problem of correcting pairwise disjoint adjacent transpositions (or swaps) in -ary strings. Equivalently, the model we assume is the radius-one instance of the so-c…
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…