On Lower Bounds on Sub-Packetization Level of MSR codes and On The Structure of Optimal-Access MSR Codes Achieving The Bound

S. B. Balaji, Myna Vajha, P. Vijay Kumar

We present two lower bounds on sub-packetization level $\alpha$ of MSR codes with parameters $(n,k,d=n-1,\alpha )$ where $n$ is the block length, $k$ dimension, $d$ number of helper nodes…