Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization

Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han

An $(n,k)$ maximum distance separable (MDS) code has optimal repair access if the minimum number of symbols accessed from $d$ surviving nodes is achieved, where $k+1\le d\le n-1$.…