Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters
Liyang Zhou, Zhifang Zhang · 2021
We consider the rack-aware storage system where n= n̅u nodes are organized in n̅ racks each containing u nodes, and any k = k̅u+u0(0 ≤ u0n̅to (d̅ - k̅+ 1)⌈n̅/u-u^-0⌉⌉ where d̅ is the number of helper racks that participate in the repair process; (2) The field size is reduced to |F|>n which is almost half of the field used in Chen&Barg's construction. Besides, our code keeps the same access level as Chen&Barg's low-access construction.