Distributed storage systems based on intersecting subspace codes

Distributed storage systems based on intersecting constant dimension (equidistant) codes are presented. These intersecting codes are constructed using the Plücker embedding, which is essential in the repair and the reconstruction algorithms. These systems possess several useful properties such as high failure resilience, minimum bandwidth, low overall storage, simple algebraic repair and reconstruction algorithms, good locality, and compatibility with small fields.