98 citations · 219 across the 62 of their papers we have counts for
4 papers · 1 filter
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…
Bounds on Codes Correcting Adjacent Transpositions
Mladen Kovačević, Han Mao Kiah, Keshav Goyal
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…
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…
BMTree: Designing, Learning, and Updating Piecewise Space-Filling Curves for Multi-Dimensional Data Indexing
Jiangneng Li, Yuang Liu, Zheng Wang +5
Space-filling curves (SFC, for short) have been widely applied to index multi-dimensional data, which first maps the data to one dimension, and then a one-dimensional indexing meth…