Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters

2021/03/29 by Zhou, Liyang, Zhang, Zhifang · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2103.15471

Abstract

We consider the rack-aware storage system where n=nu nodes are organized in n racks each containing u nodes, and any k=ku+u₀~(0≤ u₀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.

Cited by

• Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures

Related

• Rack-Aware Regenerating Codes with Fewer Helper Racks
• Rack-aware minimum-storage regenerating codes with optimal access
• Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes
• Searching for Minimum Storage Regenerating Codes
• Rack-Aware Cooperative Regenerating Codes